Part of the Lecture Notes in Computer Science book series (LNCS, volume 9943)
Dissection with the Fewest Pieces is Hard, Even to Approximate
- Cite this paper as:
- Bosboom J. et al. (2016) Dissection with the Fewest Pieces is Hard, Even to Approximate. In: Akiyama J., Ito H., Sakai T., Uno Y. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2015. Lecture Notes in Computer Science, vol 9943. Springer, Cham
We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of \(1+1/1080-\varepsilon \).
© Springer International Publishing AG 2016