Efficient Folding Algorithms for Convex Polyhedra

We investigate a folding problem that inquires whether a polygon P can be folded, without overlap or gaps, onto a polyhedron Q for given P and Q . An efficient algorithm for this problem when Q is a box was recently developed. We extend this idea to a class of convex polyhedra, which includes the f...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete & computational geometry Vol. 70; no. 4; pp. 1499 - 1522
Main Authors:	Kamata, Tonan, Kadoguchi, Akira, Horiyama, Takashi, Uehara, Ryuhei
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2023 Springer Nature B.V
Subjects:	Algorithms Apexes Combinatorics Computational Mathematics and Numerical Analysis Folding Mathematics Mathematics and Statistics Polyhedra Polynomials Tetrahedra Regular polyhedron (Platonic Stamping 52C99 68W99 Pseudo-polynomial time algorithm 52B55 Computational origami Folding problem
ISSN:	0179-5376, 1432-0444
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!