A Pseudopolynomial Algorithm for Alexandrov’s Theorem

DOI10.1007/978-3-642-03367-4_38zbMath1253.65028OpenAlexW2170315842MaRDI QIDQ3183474

Gregory N. Price, Daniel M. Kane, Erik D. Demaine

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/61985

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (11)

Bumpy pyramid folding ⋮ Generalized D-forms have no spurious creases ⋮ A Pseudopolynomial Algorithm for Alexandrov’s Theorem ⋮ Adiabatic isometric mapping algorithm for embedding 2-surfaces in Euclidean 3-space ⋮ Common developments of three incongruent boxes of area 30 ⋮ Common Developments of Three Incongruent Boxes of Area 30 ⋮ Cut locus realizations on convex polyhedra ⋮ Finding weakly simple closed quasigeodesics on polyhedral spheres ⋮ Recognition of affine-equivalent polyhedra by their natural developments ⋮ Efficient Algorithm for Box Folding ⋮ Which convex polyhedra can be made by gluing regular hexagons?

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
• The volume as a metric invariant of polyhedra
• Enumerating foldings and unfoldings between polygons and polytopes
• Rigidity and polynomial invariants of convex polytopes
• The Discrete Geodesic Problem
• A Pseudopolynomial Algorithm for Alexandrov’s Theorem

This page was built for publication: A Pseudopolynomial Algorithm for Alexandrov’s Theorem