Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Suri, S.: Surface Approximation and Geometric Partitions. SIAM Journal on Computing 27(4), 1016–1035 (1998)
Brönnimann, H., Goodrich, M.T.: Almost Optimal Set Covers in Finite VC-Dimension. Discrete and Computational Geometry 14, 263–279 (1995)
Cignoni, P., Montani, C., Scopigno, R.: DeWall: A Fast Divide & Conquer Delaunay Triangulation Algorithm in E d. Computer Aided Design 30(5), 333–341 (1998)
Das, G., Goodrich, M.T.: On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Computational Geometry: Theory and Applications 8, 123–137 (1997)
Kovalevsky, V.A.: Finite Topology as Applied to Image Analysis. Computer Vision, Graphics and Image Processing 45(2), 141–161 (1989)
Kovalevsky, V.A.: Algorithms and Data Structures for Computer Topology. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 37–58. Springer, Heidelberg (2001)
Kovalevsky, V.A.: Algorithms in Digital Geometry Based on Cellular Topology. In: Klette, R., Žunić, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 366–393. Springer, Heidelberg (2004)
Kovalevsky, V.A., Schulz, H.: Convex Hulls in a 3-dimensional Space. In: Klette, R., Žunić, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 176–196. Springer, Heidelberg (2004)
Lorensen, W.E., Cline, H.E.: Marching Cubes: A High-Resolution 3D Surface Construction Algorithm. Computer Graphics 21(4), 163–169 (1987)
O’Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1994)
Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Springer, Heidelberg (1985)
Svensson, S., Arcelli, C., Sanniti di Baja, G.: Characterising 3D Objects by Shape and Topology. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 124–133. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulz, H. (2008). Polyhedral Surface Approximation of Non-convex Voxel Sets through the Modification of Convex Hulls. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds) Combinatorial Image Analysis. IWCIA 2008. Lecture Notes in Computer Science, vol 4958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78275-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-78275-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78274-2
Online ISBN: 978-3-540-78275-9
eBook Packages: Computer ScienceComputer Science (R0)