A note on minimal length polygonal approximation to a digitized contour
From MaRDI portal
Publication:5578084
DOI10.1145/361953.361967zbMath0185.43803MaRDI QIDQ5578084
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
Related Items
Digital Straightness, A class of integro-differential Fokker–Planck equations with space-dependent coefficients, CIM algorithm for approximating three-dimensional polygonal curves, Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length, Two linear-time algorithms for computing the minimum length polygon of a digital contour, Digital straightness -- a review, What segments are the best in representing contours?, Green's function for two absorbing boundaries in the reaction-diffusion system: beyond Oster-Nishijima model in barrierless reaction, Silhouette vectorization by affine scale-space, Some aspects of the recognition of convex polyhedra from two plane projections. II, Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model, Dynamic Minimum Length Polygon, Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour, Digital Deformable Model Simulating Active Contours
