Faithful polygonal representation of the convex and concave parts of a digital curve
From MaRDI portal
Publication:2276012
DOI10.1016/J.PATCOG.2011.03.018zbMATH Open1218.68185OpenAlexW2006045576MaRDI QIDQ2276012FDOQ2276012
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)
Cites Work
- Digital straightness -- a review
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Lyndon + Christoffel = digitally convex
- Canonical representations of discrete curves
- Revisiting Digital Straight Segment Recognition
- Measure of circularity for parts of digital boundaries and its fast computation
- Detection of the discrete convexity of polyominoes
- Title not available (Why is that?)
- Polygonal representations of digital sets
- What Does Digital Straightness Tell about Digital Convexity?
- Digital Convexity, Straightness, and Convex Polygons
- Title not available (Why is that?)
- Digital Deformable Model Simulating Active Contours
- Digital Straight Lines and Convexity of Digital Regions
- Discrete convexity: Definition, parametrization, and compatibility with continuous convexity
- Digital and cellular convexity
- Multi-scale Analysis of Discrete Contours for Unsupervised Noise Detection
- Title not available (Why is that?)
Cited In (9)
- Geometric preservation of 2D digital objects under rigid motions
- 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
- Euclidean farthest-point Voronoi diagram of a digital edge
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
- Two plane-probing algorithms for the computation of the normal vector to a digital plane
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- Polygonal representations of digital sets
- An alternative definition for digital convexity
Recommendations
This page was built for publication: Faithful polygonal representation of the convex and concave parts of a digital curve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276012)
