Electronic Resource
Springer
The visual computer
11 (1994), S. 105-112
ISSN:
1432-2315
Keywords:
Computational morphology
;
Curve reconstruction
;
Minimal spanning trees
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01889981
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |