Computational geometry: an introduction
Computational geometry: an introduction
On computing simple circuits on a set of line segments
SCG '86 Proceedings of the second annual symposium on Computational geometry
Computing simple circuits from a set of line segments is NP-complete
SCG '87 Proceedings of the third annual symposium on Computational geometry
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Extended Gaussian images, mixed volumes, shape reconstruction
SCG '85 Proceedings of the first annual symposium on Computational geometry
Visibility and intersectin problems in plane geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
Turtlegons: generating simple polygons for sequences of angles
SCG '85 Proceedings of the first annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Probing a scene of non convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
| Hi-index | 0.00 |
We present an optimal algorithm to reconstruct the planar cross section of a simple object from data points measured by rays. The rays are semi-infinite curves representing, for example, the laser beam or the articulated arms of a robot moving around the object. The object is assumed to be a unique simply connected object, and the contour to be reconstructed is a simple polygon having the data points as vertices and intersecting none of the measuring rays. Such a contour does not exist for any given sets of points and rays but only for legal data. In this paper, we prove that the solution to the contour problem is unique whenever such a solution exists. For a set of n points and n rays, the algorithm presented here provides in &Ogr;(nlogn) time, a polygon which is the solution to the contour problem when the data are legal. Updating this contour if a new measure is available can be done in &Ogr;(logn) time. Both results are asymptotically optimal in the worst-case. Moreover, once the solution has been found, we can check if the data are legal in &Ogr;(nlogn) time.