On the min DSS problem of closed discrete curves

DOI10.1016/j.dam.2005.02.025zbMath1101.68904OpenAlexW1986159471MaRDI QIDQ5921693

Laure Tougne, Fabien Feschet

Publication date: 7 November 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.025

zbMATH Keywords

Discrete curves and segmentsMin DSS problemOptimal complexityTangential cover

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Tangential cover for thick digital curves ⋮ Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators ⋮ About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ Geometric preservation of 2D digital objects under rigid motions ⋮ Shape Analysis with Geometric Primitives ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ Minimum decomposition of a digital surface into digital plane segments is NP-hard ⋮ Tangential Cover for Thick Digital Curves ⋮ Digitization scheme that assures faithful reconstruction of plane figures ⋮ Comparison and improvement of tangent estimators on digital curves

Cites Work

• Discrete images, objects, and functions in \(Z^ n\)
• Digital Straight Line Segments
• Digital Straightness
• Unnamed Item
• Unnamed Item
• Unnamed Item