Wooden geometric puzzles: Design and hardness proofs

DOI10.1007/s00224-008-9104-3zbMath1192.68724WikidataQ59567703 ScholiaQ59567703MaRDI QIDQ2272190

Günter Rote, Hans L. Bodlaender, Helmut Alt, Gerard Tel, Marc J. van Kreveld

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9104-3

zbMATH Keywords

complexity; partition; geometric puzzles

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)