Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators
Publication:2384109
DOI10.1007/S10851-007-0779-XzbMath1478.68421OpenAlexW2134690498MaRDI QIDQ2384109
Fabien Feschet, François de Vieilleville, Jacques-Olivier Lachaud
Publication date: 20 September 2007
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-007-0779-x
multigrid convergenceconvex digital polygondigital curvaturedigital straightnessdiscrete geometric estimator
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete images, objects, and functions in \(Z^ n\)
- The vertices of the knapsack polytope
- The convex hull of the integer points in a large ball
- Preserving topology by a digitization process
- Sturmian words, Lyndon words and trees
- Digital Convexity, Straightness, and Convex Polygons
- Discrete Geometry for Computer Imagery
- On the min DSS problem of closed discrete curves
- Multigrid convergence of calculated features in image analysis
This page was built for publication: Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators