Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings

DOI10.1007/s00454-008-9052-3zbMath1140.52008OpenAlexW2071705258WikidataQ125762522 ScholiaQ125762522MaRDI QIDQ2482209

Igor Pak, Ezra Miller

Publication date: 16 April 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-008-9052-3

zbMATH Keywords

geodesic flowshortest pathsVoronoi diagramsconjecturesboundaries of convex polyhedraconvex polyhedral pseudomanifoldnonpolynomial complexity

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Polyhedral manifolds (52B70)

Related Items (9)

Large deviations theory for Markov jump models of chemical reaction networks ⋮ Unfoldings and nets of regular polytopes ⋮ Unfolding cubes: nets, packings, partitions, chords ⋮ Unnamed Item ⋮ Continuous blooming of convex polyhedra ⋮ Affine unfoldings of convex polyhedra ⋮ Star unfolding convex polyhedra via quasigeodesic loops ⋮ Conjugate points in length spaces ⋮ Polyhedral computational geometry for averaging metric phylogenetic trees

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• The complexity of finding minimum-length generator sequences
• Nonoverlap of the star unfolding
• A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
• Straightening polygonal arcs and convexifying polygonal cycles
• Ununfoldable polyhedra with convex faces
• Efficient computation of geodesic shortest paths
• The Discrete Geodesic Problem
• On Shortest Paths in Polyhedral Spaces
• The minimum-length generator sequence problem is NP-hard
• Geodesics in Piecewise Linear Manifolds
• A.D. Alexandrov spaces with curvature bounded below
• Lectures on Polytopes
• Star Unfolding of a Polytope with Applications
• Polyhedra with no natural unfoldings
• Pushing disks apart - the Kneser-Poulsen conjecture in the plane
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• New results on shortest paths in three dimensions

This page was built for publication: Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings