Minimal Decomposition of a Digital Surface into Digital Plane Segments is NP-Hard.Report as inadecuate




Minimal Decomposition of a Digital Surface into Digital Plane Segments is NP-Hard. - Download this document for free, or read online. Document in PDF available to download.

1 M2DisCo - Geometry Processing and Constrained Optimization LIRIS - Laboratoire d-InfoRmatique en Image et Systèmes d-information

Abstract : This paper deals with the complexity of the decomposition of a digital surface into digital plane segments DPS for short. We prove that the decision problem does there exist a decomposition with less than k DPS ? is NP-complete, and thus that the optimisation problem finding the minimal number of DPS is NP-hard. The proof is based on a polynomial reduction of any instance of the well-known 3-SAT problem to an instance of the digital surface decomposition problem. A geometric model for the 3-SAT problem is proposed.





Author: Isabelle Sivignon - David Coeurjolly -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents