Abstract
We study the straight skeleton of polyhedra in 3D. We first show that the skeleton of voxel-based polyhedra may be constructed by an algorithm taking constant time per voxel. We also describe a more complex algorithm for skeletons of voxel polyhedra, which takes time proportional to the surface-area of the skeleton rather than the volume of the polyhedron. We also show that any n-vertex axis-parallel polyhedron has a straight skeleton with O(n 2) features. We provide algorithms for constructing the skeleton, which run in O( min (n 2logn,klogO(1) n)) time, where k is the output complexity. Next, we show that the straight skeleton of a general nonconvex polyhedron has an ambiguity, suggesting a consistent method to resolve it. We prove that the skeleton of a general polyhedron has a superquadratic complexity in the worst case. Finally, we report on an implementation of an algorithm for the general case.
Work on this paper by the first and fourth authors has been supported in part by a French-Israeli Research Cooperation Grant 3-3413.
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
Aichholzer, O., Aurenhammer, F.: Straight skeletons for general polygonal figures in the plane. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 117–126. Springer, Heidelberg (1996)
Aichholzer, O., Aurenhammer, F., Alberts, D., Gärtner, B.: A novel type of skeleton for polygons. J. of Universal Computer Science 1(12), 752–761 (1995)
Barequet, G., Goodrich, M.T., Levi-Steiner, A., Steiner, D.: Contour interpolation by straight skeletons. Graphical Models 66(4), 245–260 (2004)
Bittar, E., Tsingos, N., Gascuel, M.-P.: Automatic reconstruction of unstructured 3D data: Combining a medial axis and implicit surfaces. Computer Graphics Forum 14(3), 457–468 (1995)
Blum, H.: A transformation for extracting new descriptors of shape. In: Wathen-Dunn, W. (ed.) Models for the Perception of Speech and Visual Form, pp. 362–380. MIT Press, Cambridge (1967)
Cheng, S.-W., Vigneron, A.: Motorcycle graphs and straight skeletons. In: Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 156–165 (January 2002)
Culver, T., Keyser, J., Manocha, D.: Accurate computation of the medial axis of a polyhedron. In: Proc. 5th ACM Symp. on Solid Modeling and Applications, New York, NY, pp. 179–190 (1999)
Demaine, E.D., Demaine, M.L., Lindy, J.F., Souvaine, D.L.: Hinged dissection of polypolyhedra. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 205–217. Springer, Heidelberg (2005)
Demaine, E.D., Demaine, M.L., Lubiw, A.: Folding and cutting paper. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 104–118. Springer, Heidelberg (2000)
Dey, T.K., Zhao, W.: Approximate medial axis as a Voronoi subcomplex. Computer-Aided Design 36, 195–202 (2004)
Eppstein, D.: Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete & Computational Geometry 13, 111–122 (1995)
Eppstein, D.: Fast hierarchical clustering and other applications of dynamic closest pairs. ACM J. Experimental Algorithmics 5(1), 1–23 (2000)
Eppstein, D., Erickson, J.: Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions. Discrete & Computational Geometry 22(4), 569–592 (1999)
Foskey, M., Lin, M.C., Manocha, D.: Efficient computation of a simplified medial axis. J. of Computing and Information Science in Engineering 3(4), 274–284 (2003)
Haunert, J.-H., Sester, M.: Using the straight skeleton for generalisation in a multiple representation environment. In: ICA Workshop on Generalisation and Multiple Representation (2004)
Held, M.: On computing Voronoi diagrams of convex polyhedra by means of wavefront propagation. In: Proc. 6th Canadian Conf. on Computational Geometry, pp. 128–133 (August 1994)
Price, M.A., Armstrong, C.G., Sabin, M.A.: Hexahedral mesh generation by medial surface subdivision: Part I. Solids with convex edges. Int. J. for Numerical Methods in Engineering 38(19), 3335–3359 (1995)
Sharir, M.: Almost tight upper bounds for lower envelopes in higher dimensions. Discrete & Computational Geometry 12, 327–345 (1994)
Sheehy, D.J., Armstrong, C.G., Robinson, D.J.: Shape description by medial surface construction. IEEE Trans. on Visualization and Computer Graphics 2(1), 62–72 (1996)
Sherbrooke, E.C., Patrikalakis, N.M., Brisson, E.: An algorithm for the medial axis transform of 3d polyhedral solids. IEEE Trans. on Visualization and Computer Graphics 2(1), 45–61 (1996)
Tănase, M., Veltkamp, R.C.: Polygon decomposition based on the straight line skeleton. In: Proc. 19th Ann. ACM Symp. on Computational Geometry, pp. 58–67 (June 2003)
Wiernik, A., Sharir, M.: Planar realizations of nonlinear Davenport-Schinzel sequences by segments. Discrete & Computational Geometry 3, 15–47 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barequet, G., Eppstein, D., Goodrich, M.T., Vaxman, A. (2008). Straight Skeletons of Three-Dimensional Polyhedra. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)