Efficient segment folding is hard

DOI10.1016/j.comgeo.2022.101860OpenAlexW4207057037MaRDI QIDQ2123292

Fabian Klute, Takashi Horiyama, Irene Parada, Katsuhisa Yamanaka, Matias Korman, Ryuhei Uehara

Publication date: 8 April 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.11062

zbMATH Keywords

NP-hardnesscomputational origamisegment foldingsimple folds

Mathematics Subject Classification ID

Computer science (68-XX) Convex and discrete geometry (52-XX) Geometry (51-XX)

Cites Work

• Inserting one edge into a simple drawing is hard

This page was built for publication: Efficient segment folding is hard