The complexity of (un)folding

DOI10.1145/777792.777818zbMath1374.68634OpenAlexW2014941232MaRDI QIDQ5361620

Günter Rote, Helmut Alt, Christian Knauer, S. H. Whitesides

Publication date: 29 September 2017

Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/777792.777818

zbMATH Keywords

computational geometryPSPACE-completenesslinkage reconfiguration

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees ⋮ When can a net fold to a polyhedron?

This page was built for publication: The complexity of (un)folding