The complexity of (un)folding
From MaRDI portal
Publication:5361620
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
This page was built for publication: The complexity of (un)folding