r-regular shape reconstruction from unorganized points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Crust and anti-crust: a one-step boundary and skeleton extraction algorithm
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Curve reconstruction, the traveling salesman problem and Menger's theorem on length
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A simple provable algorithm for curve reconstruction
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Reconstruction curves with sharp corners
Proceedings of the sixteenth annual symposium on Computational geometry
TSP-based curve reconstruction in polynomial time
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Curve reconstruction: connecting dots with good reason
Computational Geometry: Theory and Applications
Shape Reconstruction with Delaunay Complex
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Curve reconstruction from noisy samples
Proceedings of the nineteenth annual symposium on Computational geometry
Curve reconstruction from noisy samples
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
A distance-based parameter free algorithm for curve reconstruction
Computer-Aided Design
VICUR: A human-vision-based algorithm for curve reconstruction
Robotics and Computer-Integrated Manufacturing
Optimization-based approach for curve and surface reconstruction
Computer-Aided Design
Curve reconstruction from noisy samples
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
How to cover a point set with a V-shape of minimum width
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
Robust reconstruction of 2D curves from scattered noisy point data
Computer-Aided Design
| Hi-index | 0.00 |
We present an algorithm which provably reconstructs a collection of curves with corners and endpoints from a sample set that satisfies a certain sampling condition. The algorithm outputs a polygonal reconstruction that contains the edges in the correct reconstruction of the curves and such that any additional edge between sample points is justified. Furthermore, we show that for any such collection of curves, there exists a sample set such that a slightly modified version of our algorithm outputs exactly the correct reconstruction. The algorithm also performs quite well in practice.