Faithful polygonal representation of the convex and concave parts of a digital curve
From MaRDI portal
Publication:2276012
DOI10.1016/j.patcog.2011.03.018zbMath1218.68185OpenAlexW2006045576MaRDI QIDQ2276012
Tristan Roussillon, Isabelle Sivignon
Publication date: 10 August 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2011.03.018
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ Two plane-probing algorithms for the computation of the normal vector to a digital plane ⋮ Convexity preserving deformations of digital sets: characterization of removable and insertable pixels ⋮ Geometric preservation of 2D digital objects under rigid motions ⋮ Euclidean farthest-point Voronoi diagram of a digital edge ⋮ An alternative definition for digital convexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measure of circularity for parts of digital boundaries and its fast computation
- Lyndon + Christoffel = digitally convex
- Canonical representations of discrete curves
- Digital and cellular convexity
- Digital straightness -- a review
- Detection of the discrete convexity of polyominoes
- Polygonal representations of digital sets
- Discrete convexity: Definition, parametrization, and compatibility with continuous convexity
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Digital Deformable Model Simulating Active Contours
- What Does Digital Straightness Tell about Digital Convexity?
- Multi-scale Analysis of Discrete Contours for Unsupervised Noise Detection
- Digital Straight Lines and Convexity of Digital Regions
- Digital Convexity, Straightness, and Convex Polygons
- Revisiting Digital Straight Segment Recognition
