short-paper

Straight skeletons of three-dimensional polyhedra

Authors:

Gill Barequet,

Amir VaxmanAuthors Info & Claims

SCG '09: Proceedings of the twenty-fifth annual symposium on Computational geometry

Pages 100 - 101

https://doi.org/10.1145/1542362.1542384

Published: 08 June 2009 Publication History

Get Access

Abstract

In this video we present an algorithm for computing the straight skeleton of a polyhedron in three dimensions.

References

[1]

O. Aichholzer, F. Aurenhammer, D. Alberts, and B. Gartner,A novel type of skeleton for polygons, J. of Universal Computer Science, 1 (1995), 752--761.

Google Scholar

[2]

G. Barequet, D. Eppstein, M.T. Goodrich, and A. Vaxman,Straight skeletons of three-dimensional polyhedra, Proc. 16th Ann. European Symp. on Algorithms,Karlsruhe, Germany, LNCS, 5193,Springer-Verlag, 148--160, 2008.

Digital Library

Google Scholar

[3]

G. Barequet, M.T. Goodrich, A. Levi-Steiner, and D. Steiner,Contour interpolation by straight skeletons, Graphical Models,66 (2004), 245--260.

Digital Library

Google Scholar

[4]

E. Bittar, N. Tsingos, and M.-P. Gascuel, Automatic reconstruction of unstructured 3D data: Combining a medialaxis and implicit surfaces, Computer Graphics Forum,14 (1995), 457--468.

Digital Library

Google Scholar

[5]

H. Blum, A transformation for extracting new descriptors of shape,in: Models for the Perception of Speech and Visual Form(W. Wathen-Dunn, ed.), MIT Press,362--380, 1967.

Google Scholar

[6]

S.-W. Cheng and A. Vigneron,Motorcycle graphs and straight skeletons, Proc. 13th Ann. ACM--SIAM Symp. on Discrete Algorithms,San Francisco, CA, 156--165, 2002.

Digital Library

Google Scholar

[7]

E.D. Demaine, M.L. Demaine, J.F. Lindy, and D.L. Souvaine,Hinged dissection of polypolyhedra, Proc. 9th Workshop on Algorithms and Data Structures, Waterloo, Ontario, Canada,phLNCS, 3608,Springer-Verlag, 205--217, 2005.

Digital Library

Google Scholar

[8]

E.D. Demaine, M.L. Demaine, and A. Lubiw, Folding and cutting paper,in: Revised Papers from the Japan Conf. on Discrete and Computational Geometry, Lecture Notes in Computer Science, 1763, Springer-Verlag, 104--117, 1998.

Digital Library

Google Scholar

[9]

D. Eppstein and J. Erickson,Raising roofs, crashing cycles, and playing pool: Applications of adata structure for finding pairwise interactions,phDiscrete & Comp. Geometry,22 (1999), 569--592.

Crossref

Google Scholar

[10]

M. Held, On computing Voronoi diagrams of convex polyhedra by means of wavefront propagation, Proc. 6th Canadian Conf. on Computational Geometry,Saskatoon, Saskatchewan, Canada,128--133, 1994.

Google Scholar

[11]

M.A. Price, C.G. Armstrong, and M.A. Sabin, Hexahedral mesh generation by medial surface subdivision: Part I. Solids with convex edges, Int. J. for Numerical Methods in Engineering,38 (1995), 3335--3359.

Crossref

Google Scholar

[12]

M. Tuanase and R.C. Veltkamp,Polygon decomposition based on the straight line skeleton, Proc. 19th Ann. ACM Symp. on Computational Geometry,San Diego, CA,58--67, 2003.

Digital Library

Google Scholar

Index Terms

Straight skeletons of three-dimensional polyhedra
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Distance functions and skeletal representations of rigid and non-rigid planar shapes

Shape skeletons are fundamental concepts for describing the shape of geometric objects, and have found a variety of applications in a number of areas where geometry plays an important role. Two types of skeletons commonly used in geometric computations ...
Continuously Flattening Polyhedra Using Straight Skeletons
SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry

We prove that a surprisingly simple algorithm folds the surface of every convex polyhedron, in any dimension, into a flat folding by a continuous motion, while preserving intrinsic distances and avoiding crossings. The flattening respects the straight-...
Straight Skeletons of Three-Dimensional Polyhedra
ESA '08: Proceedings of the 16th annual European symposium on Algorithms

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, ...

Comments

Information & Contributors

Information

Published In

SCG '09: Proceedings of the twenty-fifth annual symposium on Computational geometry

June 2009

426 pages

ISBN:9781605585017

DOI:10.1145/1542362

Program Chairs:
John Hershberger
Mentor Graphics Corp.
,
Efi Fogel
Tel Aviv University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 June 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

SoCG '09

Sponsor:

SoCG '09: 25th Annual Symposium on Computational Geometry

June 8 - 10, 2009

Aarhus, Denmark

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
239
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Distance functions and skeletal representations of rigid and non-rigid planar shapes

Continuously Flattening Polyhedra Using Straight Skeletons

Straight Skeletons of Three-Dimensional Polyhedra