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

Isabelle Sivignon 1 David Coeurjolly 1
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.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00185124
Contributor : Isabelle Sivignon <>
Submitted on : Tuesday, November 6, 2007 - 10:42:06 AM
Last modification on : Wednesday, October 31, 2018 - 12:24:22 PM
Long-term archiving on : Monday, April 12, 2010 - 1:19:41 AM

File

segmNP_revised.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00185124, version 1

Citation

Isabelle Sivignon, David Coeurjolly. Minimal Decomposition of a Digital Surface into Digital Plane Segments is NP-Hard.. Discrete Geometry for computer Imagery, Oct 2006, Szeged, Hungary. pp.674-685. ⟨hal-00185124⟩

Share

Metrics

Record views

348

Files downloads

329