Computational morphology of curves

@article{Figueiredo2005ComputationalMO,
  title={Computational morphology of curves},
  author={Luiz Henrique de Figueiredo and Jonas Gomes},
  journal={The Visual Computer},
  year={2005},
  volume={11},
  pages={105-112}
}
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. 
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

52 Citations

0510'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Computational Morphology of Implicit Curves

  • LH Figueiredo
  • Doctoral thesis,
  • 1992
2 Excerpts

The y-neighborhood graph

  • RC Veltkamp
  • Comput Geom Theory Appl
  • 1992
1 Excerpt

A framework for computational morphology

  • DG Kirkpatrick, JD Radke
  • In: Toussaint G (ed) Computational Geometry…
  • 1985
1 Excerpt

Pattern recognition and computational complexity

  • G Toussaint
  • Proceedings of the Fifth International Conference…
  • 1980
2 Excerpts

Differential Topology, Graduate Texts

  • MW Hirsh
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…