Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
From MaRDI portal
Publication:5386070
DOI10.1007/11907350_57zbMath1136.68600OpenAlexW1576865220MaRDI QIDQ5386070
Isabelle Sivignon, David Coeurjolly
Publication date: 17 April 2008
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11907350_57
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects, Shape Analysis with Geometric Primitives, 3D noisy discrete objects: Segmentation and application to smoothing