In this paper we want to introduce an algorithm for the creation of polyhedral approximations for objects represented as strongly connected sets of voxels in three-dimensional binary images. The algorithm generates the convex hull of a given object and modifies the hull afterwards by recursive repetitions of generating convex hulls of subsets of the given voxel set or subsets of the background voxels. The result of this method is a polyhedron which separates object voxels from background voxels. The objects processed by this algorithm and also the background voxel components inside the convex hull of the objects are restricted to have genus 0. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Schulz, H. (2008). Polyhedral surface approximation of non-convex voxel sets through the modification of convex hulls. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4958 LNCS, pp. 38–50). Springer Verlag. https://doi.org/10.1007/978-3-540-78275-9_4
Mendeley helps you to discover research relevant for your work.