Faithful polygonal representation of the convex and concave parts of a digital curve

DOI10.1016/J.PATCOG.2011.03.018MaRDI QIDQ2276012zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

convex and concave partsdigital curvepolygonal representation

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• What does digital straightness tell about digital convexity?
• Polygonal representations of digital sets
• Dynamic minimum length polygon
• Canonical representations of discrete curves
• A non-parametric sequential method for polygonal approximation of digital curves

Cites work

• Canonical representations of discrete curves
• Detection of the discrete convexity of polyominoes
• Digital and cellular convexity
• Digital Convexity, Straightness, and Convex Polygons
• Digital Deformable Model Simulating Active Contours
• Digital Straight Lines and Convexity of Digital Regions
• Digital straightness -- a review
• Discrete convexity: Definition, parametrization, and compatibility with continuous convexity
• scientific article; zbMATH DE number 3956457 (Why is no real title available?)
• scientific article; zbMATH DE number 48159 (Why is no real title available?)
• scientific article; zbMATH DE number 2084493 (Why is no real title available?)
• Lyndon + Christoffel = digitally convex
• Measure of circularity for parts of digital boundaries and its fast computation
• Multi-scale analysis of discrete contours for unsupervised noise detection
• Polygonal representations of digital sets
• Revisiting Digital Straight Segment Recognition
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• What does digital straightness tell about digital convexity?

Cited in

(16)

• Greyscale image vectorization from geometric digital contour representations
• Geometric preservation of 2D digital objects under rigid motions
• Polygonal representations of digital sets
• A polygonal approximation for general 4-contours corresponding to weakly simple curves
• Euclidean farthest-point Voronoi diagram of a digital edge
• Two plane-probing algorithms for the computation of the normal vector to a digital plane
• An output-sensitive algorithm to compute the normal vector of a digital plane
• Dynamic minimum length polygon
• What does digital straightness tell about digital convexity?
• An alternative definition for digital convexity
• Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
• Computing the minimal perimeter polygon for digital objects in the triangular tiling
• Decomposition of rational discrete hyperplanes
• Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones
• Fast and exact convex and concave decomposition of digitized shapes
• Canonical representations of discrete curves

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)