Two linear-time algorithms for computing the minimum length polygon of a digital contour

DOI10.1016/J.DAM.2011.08.002MaRDI QIDQ765322zbMATHOpenAlexFDO

Authors Jacques-Olivier Lachaud, Xavier Provençal

Publication date 19 March 2012

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

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

zbMATH Keywords

shape analysisdiscrete geometrycombinatorics on wordsminimum length polygonmultigrid convergent length estimator

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• Time-and space-optimal contour computation for a set of rectangles
• An optimal algorithm for polygonal approximation of digitized curves
• A linear time algorithm for max-min length triangulation of a convex polygon
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
• scientific article; zbMATH DE number 988752
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Cites work

• scientific article; zbMATH DE number 437533 (Why is no real title available?)
• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• scientific article; zbMATH DE number 3533716 (Why is no real title available?)
• scientific article; zbMATH DE number 1241781 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 2084502 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• scientific article; zbMATH DE number 1436417 (Why is no real title available?)
• A note on minimal length polygonal approximation to a digitized contour
• An Approach for the Estimation of the Precision of a Real Object from its Digitization
• Certain words on the real projective line
• Combinatorics on Words
• Digital Deformable Model Simulating Active Contours
• Discrete images, objects, and functions in \(Z^ n\)
• Factorizing words over an ordered alphabet
• Geometric properties for incomplete data.
• Lyndon + Christoffel = digitally convex
• Minimum-Perimeter Polygons of Digitized Silhouettes
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• On piecewise linear approximation of planar Jordan curves
• On-line construction of the convex hull of a simple polyline
• Optimal shortest path queries in a simple polygon
• Some combinatorial properties of Sturmian words
• Sturmian words, Lyndon words and trees
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• What does digital straightness tell about digital convexity?

Cited in

(8)

• Computing the minimal perimeter polygon for digital objects in the triangular tiling
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• Combinatorial Image Analysis
• Euclidean farthest-point Voronoi diagram of a digital edge
• scientific article; zbMATH DE number 2084497 (Why is no real title available?)
• Discrete Geometry for Computer Imagery
• A polygonal approximation for general 4-contours corresponding to weakly simple curves
• Dynamic minimum length polygon

This page was built for publication: Two linear-time algorithms for computing the minimum length polygon of a digital contour

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765322)