Efficient Algorithm for Box Folding

DOI10.7155/JGAA.00520MaRDI QIDQ5216283zbMATH OpenOpenAlexFDO

Authors Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara

Publication date 17 February 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

box folding problempolygonpolyhedronpseudo polynomial time algorithm

Mathematics Subject Classification ID

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

Recommendations

• Efficient algorithm for box folding
• Efficient folding algorithms for convex polyhedra
• Implementation of a fast box-counting algorithm
• OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
• Parameterized algorithms for boxicity
• On-line potato-sack algorithm efficient for packing into small boxes

Cites work

• A Pseudopolynomial Algorithm for Alexandrov’s Theorem
• Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
• Bumpy pyramid folding
• Common developments of three incongruent boxes of area 30
• Common developments of three incongruent orthogonal boxes
• DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES
• Geometric folding algorithms. Linkages, origami, polyhedra
• Tile-Makers and Semi-Tile-Makers

Cited in

(4)

• Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
• Efficient algorithm for box folding
• Common developments of three incongruent boxes of area 30
• Efficient folding algorithms for convex polyhedra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216283)