Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard

Isabelle Sivignon, David Coeurjolly. Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard. In Attila Kuba, László G. Nyúl, Kálmán Palágyi, editors, Discrete Geometry for Computer Imagery, 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings. Volume 4245 of Lecture Notes in Computer Science, pages 674-685, Springer, 2006. [doi]

Abstract

Abstract is missing.