Abstract
We prove that euclidean minimal spanning trees correctly reconstruct differentiable arcs from sufficiently dense samples. The proof is based on a combinatorial characterization of minimal spanning paths and on a description of the local geometry of ares inside tubular neighborhoods. We also present simple heuristics for reconstruting more general curves.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arnon DS (1983) Topologically reliable display of algebraic curves. Comput Graph 17:219–227
Boissonnat J-D (1984) Geometric structures for three-dimensional shape representation. ACM Trans Graph 3:266–286
Duda RO, Hart PE (1973) Pattern Classification and Scene Analysis. Wiley
Figueiredo LH (1992) Computational Morphology of Implicit Curves. Doctoral thesis, IMPA, Rio de Janeiro
Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1992) Surface reconstruction from unorganized points. Comput Graph 26:71–78
Hirsh MW (1976) Differential Topology, Graduate Texts in Mathematics 33, Springer, Berlin, Heidelberg, New York
Kirkpatrick DG, Radke JD (1985) A framework for computational morphology. In: Toussaint G (ed) Computational Geometry. North-Holland, pp 217–248
Prim RC (1957) Shortest connection matrix network and some generalizations. Bell Syst Tech J 36:1389–1401
Toussaint G (1980) Pattern recognition and computational complexity. Proceedings of the Fifth International Conference on Pattern Recognition, pp 1324–1347
Veltkamp RC (1992) The ψ-neighborhood graph. Comput Geom Theory Appl 1:227–246
Zahn CT (1971) Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans Comput C 20:68–86
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
de Figueiredo, L.H., de Miranda Gomes, J. Computational morphology of curves. The Visual Computer 11, 105–112 (1994). https://doi.org/10.1007/BF01889981
Issue Date:
DOI: https://doi.org/10.1007/BF01889981