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.002zbMATH Open1246.68250OpenAlexW2031977299MaRDI QIDQ765322FDOQ765322
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
shape analysisdiscrete geometrycombinatorics on wordsminimum length polygonmultigrid convergent length estimator
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Certain words on the real projective line
- Sturmian words, Lyndon words and trees
- On piecewise linear approximation of planar Jordan curves
- Geometric properties for incomplete data.
- Title not available (Why is that?)
- Factorizing words over an ordered alphabet
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Title not available (Why is that?)
- A note on minimal length polygonal approximation to a digitized contour
- Minimum-Perimeter Polygons of Digitized Silhouettes
- Discrete images, objects, and functions in \(Z^ n\)
- Lyndon + Christoffel = digitally convex
- Combinatorics on Words
- Title not available (Why is that?)
- Some combinatorial properties of Sturmian words
- Title not available (Why is that?)
- Optimal shortest path queries in a simple polygon
- What Does Digital Straightness Tell about Digital Convexity?
- On-line construction of the convex hull of a simple polyline
- Title not available (Why is that?)
- Digital Deformable Model Simulating Active Contours
- Title not available (Why is that?)
- An Approach for the Estimation of the Precision of a Real Object from its Digitization
Cited In (7)
- Discrete Geometry for Computer Imagery
- A polygonal approximation for general 4-contours corresponding to weakly simple curves
- Euclidean farthest-point Voronoi diagram of a digital edge
- Title not available (Why is that?)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- Combinatorial Image Analysis
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 👍 👎
- Title not available (Why is that?) 👍 👎
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves 👍 👎
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)
