Reconstructing curves without delaunay computation

Algorithmica (New York)

Volumn 42, Issue 1, 2005, Pages 75-94

  Guha, Sumanta ^a   Tran, Son Dinh ^b  

^a ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Computational geometry; Curvature; Curve reconstruction; Local feature size; Octree; Surface reconstruction

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; DATA STRUCTURES; DIFFERENTIATION (CALCULUS); IMAGE PROCESSING; ITERATIVE METHODS; ROBUSTNESS (CONTROL SYSTEMS); TREES (MATHEMATICS); TRIANGULATION;

CURVATURES; CURVE RECONSTRUCTION; LOCAL FEATURE SIZES; OCTREE;

COMPUTATIONAL GEOMETRY;

EID: 17444386995     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1141-y     Document Type: Article

References (22)

1. H.-K. Ahn, O. Cheong, J. Matoušek, A. Vigneron, Reachability by paths of bounded curvature in convex polygons, Proc. ACM Symp. Comp. Geom. (2001), pp. 251-259.
2. E. Althaus, K. Mehlhom, Polynomial time TSP-based curve reconstruction, Proc. ACM-SIAM Symp. Discrete Algorithms (2000), pp. 686-695.
3. N. Amenta, M. Bern, D. Eppstein, The crust and the β-skeleton: combinatorial curve reconstruction, Graphical Models Image Process. 60(2) (1998), 125-135.
4. D. Attali, r-Regular shape reconstruction from unorganized points, Proc. ACM Symp. Comp. Geom. (1997), pp. 248-253.
5. F. Bernardini, C.L. Bajaj, Sampling and reconstructing manifolds using α-shapes, Proc. 9th Canad. Conf. Comp. Geom. (1997), pp. 193-198.
6. M. de Berg, M. van Kreveld, M. Overman, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd edn., Springer-Verlag, New York, 2000.
7. T.K. Dey, P. Kumar, A simple provable algorithm for curve reconstruction, Proc. ACM-SIAM Symp. Discrete Algorithms (1999), pp. 893-894.
8. T.K. Dey, K. Mehlhorn, E. Ramos, Curve reconstruction: connecting dots with good reason, Comput. Geom. Theory Appl. 15 (2000), 229-244.
9. T.K. Dey, R. Wenger, Reconstructing curves with sharp corners, Proc. ACM Symp. Comp. Geom. (2000), pp. 233-241.
10. M. Do Carmo, Differential Geometry of Curves and Surfaces, Prentice-Hall, Englewood Cliffs, NJ, 1976.
11. H. Edelsbrunner, Shape reconstruction with Delaunay complex, LATIN '98: Theoretical Informatics (1998), pp. 119-132, LNCS 1380, Springer-Verlag, Berlin, 1998.
12. H. Edelsbrunner, D.G. Kirkpatrick, R. Seidel, On the shape of sets of points on the plane, IEEE Trans. Inform. Theory 29 (1983), pp. 71-78.
13. L.H. de Figueiredo, J. de Miranda Gomes, Computational morphology of curves, Visual Comput. 11 (1995), 105-112.
14. J. Giesen, Curve reconstruction, the traveling salesman problem and Menger's theorem on length, Proc. ACM Symp. Comp. Geom. (1999), pp. 207-216.
15. C.M. Gold, J. Snoeyink, A one-step crust and skeleton extraction algorithm, Algorithmica 30 (2001), 144-163.
16. M. Gopi, Theory and Practice of Sampling and Reconstruction for Manifolds with Boundaries, Ph.D. Dissertation, University of North Carolina, 2001. http://www. cs.unc.edu/~gopi/dis.pdf.
17. M. Gopi, S. Krishnan, C.T. Silva, Surface reconstruction based on lower dimensional localized Delaunay triangulation, Proc. EUROGRAPHICS 2000 (2000), pp. C467-C478.
18. M. Melkemi, A-shapes of a finite point set, Proc. ACM Symp. Comp. Geom. (1997), pp. 367-372.
19. J. O'Rourke, H. Booth, R. Washington, Connect-the-dots: a new heuristic, Comput. Vision Graphics Image Process. 39 (1987), 258-266.
20. G. Pestov, V. Ionin, On the largest possible circle imbedded in a given closed curve, Dakl. Akad. Nauk SSSR 127 (1959), 1170-1172.
21. PointsNBoxes, freely downloadable curve reconstruction software, http://www.cs.ait.ac.th/~guha/PointsNBoxes.
22. R.C. Veltkamp, The γ-neighborhood graph, Comput. Geom. Theory Appl. 1 (1992), 227-246.