Two linear-time algorithms for computing the minimum length polygon of a digital contour
From MaRDI portal
Publication:765322
DOI10.1016/j.dam.2011.08.002zbMath1246.68250OpenAlexW2031977299MaRDI QIDQ765322
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
discrete geometrycombinatorics on wordsshape analysisminimum length polygonmultigrid convergent length estimator
Related Items
A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ Euclidean farthest-point Voronoi diagram of a digital edge
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete images, objects, and functions in \(Z^ n\)
- Lyndon + Christoffel = digitally convex
- On-line construction of the convex hull of a simple polyline
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Certain words on the real projective line
- Some combinatorial properties of Sturmian words
- Sturmian words, Lyndon words and trees
- Optimal shortest path queries in a simple polygon
- On piecewise linear approximation of planar Jordan curves
- Geometric properties for incomplete data.
- Factorizing words over an ordered alphabet
- Combinatorics on Words
- 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?
- An Approach for the Estimation of the Precision of a Real Object from its Digitization
- A note on minimal length polygonal approximation to a digitized contour
- Minimum-Perimeter Polygons of Digitized Silhouettes
