Skip to main content
Conference ProceedingsOPEN ACCESS

The <3,4,5> curvilinear skeleton

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5810 LNCS 409-420
DOI: 10.1007/978-3-642-04397-0_35
2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new skeletonization algorithm is presented to compute the curvilinear skeleton of 3D objects. The algorithm is based on the use of the <3,4,5> distance transform, on the detection of suitable anchor points, and on iterated topology preserving voxel removal. The obtained skeleton is topologically correct, is symmetrically placed within the object and its structure reflects the morphology of the represented object. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Arcelli, C., Sanniti Di Baja, G., & Serino, L. (2009). The <3,4,5> curvilinear skeleton. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5810 LNCS, pp. 409–420). https://doi.org/10.1007/978-3-642-04397-0_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free