A note on minimal length polygonal approximation to a digitized contour
From MaRDI portal
Publication:5578084
DOI10.1145/361953.361967zbMATH Open0185.43803OpenAlexW2094845328MaRDI QIDQ5578084FDOQ5578084
Authors: Ugo Montanari 
Publication date: 1970
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361953.361967
Cited In (15)
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
- Green's function for two absorbing boundaries in the reaction-diffusion system: beyond Oster-Nishijima model in barrierless reaction
- A class of integro-differential Fokker–Planck equations with space-dependent coefficients
- Digital Deformable Model Simulating Active Contours
- Silhouette vectorization by affine scale-space
- Digital straightness -- a review
- Combining topological maps, multi-label simple points, and minimum-length polygons for efficient digital partition model
- CIM algorithm for approximating three-dimensional polygonal curves
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Digital straightness
- 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
- Dynamic minimum length polygon
- What segments are the best in representing contours?
- Some aspects of the recognition of convex polyhedra from two plane projections. II
This page was built for publication: A note on minimal length polygonal approximation to a digitized contour
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578084)
