Skip to main content
Conference ProceedingsOPEN ACCESS

Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation

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

This article is free to access.

Abstract

This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Palágyi, K., & Németh, G. (2009). Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5810 LNCS, pp. 481–492). https://doi.org/10.1007/978-3-642-04397-0_41

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