Bumpy pyramid folding
From MaRDI portal
Publication:1615921
DOI10.1016/j.comgeo.2018.06.007zbMath1443.68194OpenAlexW2954834823MaRDI QIDQ1615921
Zachary R. Abel, Martin L. Demaine, Erik D. Demaine, Hiro Ito, Ryuhei Uehara, Jack Scott Snoeyink
Publication date: 31 October 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2018.06.007
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Common developments of three incongruent boxes of area 30 ⋮ Efficient Algorithm for Box Folding ⋮ Developing a tetramonohedron with minimum cut length
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
- Nonoverlap of the star unfolding
- The volume as a metric invariant of polyhedra
- A Pseudopolynomial Algorithm for Alexandrov’s Theorem
- Power Diagrams: Properties, Algorithms and Applications
This page was built for publication: Bumpy pyramid folding
