Abstract
Curve-thinning is a frequently applied technique to obtain centerlines from volumetric binary objects. Conventional curve-thinning algorithms preserve endpoints to provide important geometric information relative to the objects. An alternative strategy is also proposed that accumulates isthmuses (i.e., generalization of curve interior points as elements of the centerlines). This paper presents a computationally efficient sequential isthmus-based 3D curve-thinning algorithm.
Cite
CITATION STYLE
Palágyi, K. (2014). A sequential 3D curve-thinning algorithm based on isthmuses. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8888, pp. 406–415). Springer Verlag. https://doi.org/10.1007/978-3-319-14364-4_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
