Efficient Algorithm for Box Folding

DOI10.7155/jgaa.00520zbMath1434.51017OpenAlexW3005219863MaRDI QIDQ5216283

Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara

Publication date: 17 February 2020

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00520

zbMATH Keywords

polyhedronpolygonpseudo polynomial time algorithmbox folding problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geometric constructions in real or complex geometry (51M15)

Related Items (1)

Efficient folding algorithms for convex polyhedra

Cites Work

• Unnamed Item
• Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
• Bumpy pyramid folding
• Common developments of three incongruent boxes of area 30
• A Pseudopolynomial Algorithm for Alexandrov’s Theorem
• COMMON DEVELOPMENTS OF THREE INCONGRUENT ORTHOGONAL BOXES
• DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES
• Tile-Makers and Semi-Tile-Makers

This page was built for publication: Efficient Algorithm for Box Folding