Songxiang Gu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper describes a quick 3D-to-2D point matching algorithm. Our major contribution is to substitute a new O(2 n) algorithm for the traditional N ! method by introducing a convex hull based enumer-ator. Projecting a 3D point set into a 2D plane yields a corresponding 2D point set. In some cases, matching information is lost. Therefore, we wish to recover(More)
  • 1