Curve reconstruction: Connecting dots with good reason

Computational Geometry: Theory and Applications

Volumn 15, Issue 4, 2000, Pages 229-244

  Dey, Tamal K ^a   Mehlhorn, Kurt ^b   Ramos, Edgar A ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Curve fitting; Curve modeling; Curve reconstruction; Geometric modeling; Pattern recognition; Sampling

Indexed keywords

EID: 0000621099     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00051-6     Document Type: Article

References (17)

1. N. Amenta, M. Bern, D. Eppstein, The crust and the β-skeleton: combinatorial curve reconstruction, Graphical Models Image Process. 60 (1998) 125-135.
2. D. Attali, r-regular shape reconstruction from unorganized points, in: Proc. 13th Ann. Sympos. Comput. Geom., 1997, pp. 248-253.
3. F. Bernardini, C.L. Bajaj, Sampling and reconstructing manifolds using α-shapes, in: Proc. 9th Canadian Conf. Comput. Geom., 1997, pp. 193-198.
4. J. Brandt, V.R. Algazi, Continuous skeleton computation by Voronoi diagram, Comput. Vision, Graphics, Image Process. 55 (1992) 329-338.
5. T.K. Dey, P. Kumar, A simple provable algorithm for curve reconstruction, in: Proc. 10th. ACM-SIAM Sympos. Discr. Algorithms, 1999, pp. 893-894.
6. H. Edelsbrunner, Shape reconstruction with Delaunay complex, in: Proc. of LATIN'98: Theoretical Informatics, Lecture Notes in Computer Science, Vol. 1380, 1998, pp. 119-132.
7. H. Edelsbrunner, D.G. Kirkpatrick, R. Seidel, On the shape of a set of points in the plane, IEEE Trans. Inform. Theory 29 (4) (1983) 71-78.
8. L.H. Figueiredo, J.M. Gomes, Computational morphology of curves, Visual Comput. 11 (1994) 105-112.
9. J. Giesen, Curve reconstruction, the TSP, and Menger's theorem on length, in: Proc. 15th Ann. Sympos. Comput. Geom., 1999, pp. 207-216.
10. C. Gold, Crust and anti-crust: a one-step boundary and skeleton extraction algorithm, in: Proc. 15th Ann. Sympos. Comput. Geom., 1999, pp. 189-196.
11. D.G. Kirkpatrick, J.D. Radke, A framework for computational morphology, in: G. Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, pp. 217-248.
12. LEDA (Library of Efficient Data Types and Algorithms), http://www.mpi-sb.mpg.de/LEDA/leda.html
13. M. Melkemi, A-shapes of a finite point set, in: Proc. 13th Ann. Sympos. Comput. Geom., 1997, pp. 367-369.
14. F.P. Preparata, M.I. Shamos, Computational Geometry. An Introduction, Springer, New York, 1985.
15. G. Toussaint, Pattern recognition and computational complexity, in: Proc. 5th Internat. Conf. Pattern Recognition, 1980, pp. 1324-1347.
16. R.C. Veltkamp, The γ-neighborhood graph, Computational Geometry 1 (1992) 227-246.
17. C.T. Zahn, Graph-theoretical methods for detecting and describing gestalt clusters, IEEE Trans. Comput. 20 (1971) 68-86.