Structure and Computation of Straight Skeletons in 3-Space

We characterize the self-parallel (mitered) offsets of a general nonconvex polytope \(\mathcal{Q}\) in 3-space and give a canonical algorithm that constructs a straight skeleton for \(\mathcal{Q}\).

[1]  Kurt Mehlhorn,et al.  Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings , 2008, ESA.

[2]  Gabriella Sanniti di Baja,et al.  On Medial Representations , 2008, CIARP.

[3]  Kaleem Siddiqi,et al.  Medial Representations: Mathematics, Algorithms and Applications , 2008 .

[4]  Franz Aurenhammer,et al.  A Novel Type of Skeleton for Polygons , 1996 .

[5]  Erik D. Demaine,et al.  Hinged Dissection of Polypolyhedra , 2005, WADS.

[6]  Leonidas J. Guibas,et al.  Vertical decompositions for triangles in 3-space , 1994, SCG '94.

[7]  Joseph O'Rourke,et al.  Discrete and Computational Geometry , 2011 .

[8]  Gill Barequet,et al.  Straight Skeletons of Three-Dimensional Polyhedra , 2008, ESA.

[9]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[10]  Jonàs Martínez,et al.  Eurographics Symposium on Geometry Processing 2011 Skeleton Computation of Orthogonal Polyhedra , 2022 .

[11]  Franz Aurenhammer.  Weighted skeletons and fixed-share decomposition , 2008, Comput. Geom..

[12]  GERNOT WALZL.  THREE-DIMENSIONAL STRAIGHT SKELETONS FROM BISECTOR GRAPHS FRANZ AURENHAMMER AND , 2013 .

[13]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[14]  David Eppstein,et al.  Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions , 1998, SCG '98.

[15]  Antoine Vigneron,et al.  A Faster Algorithm for Computing Motorcycle Graphs , 2014, Discret. Comput. Geom..