Minimum-Perimeter Polygons of Digitized Silhouettes

DOI10.1109/TC.1972.5008948zbMath0232.68040MaRDI QIDQ5640754

Jack Sklansky, Bruce J. Hansen, R. L. Chazin

Publication date: 1972

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (16)

Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length ⋮ A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ On piecewise linear approximation of planar Jordan curves ⋮ Fault diagnosis based on comprehensive geometric characteristic and probability neural network ⋮ On generalized predictive compression of continuous-time signal samples ⋮ New approach for automated inspection and feedback control systems ⋮ A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects ⋮ Digital and cellular convexity ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ Connectivity augmentation in planar straight line graphs ⋮ Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model ⋮ Dynamic Minimum Length Polygon ⋮ Moment-based methods for polygonal approximation of digitized curves ⋮ A method for vertex recognition in an automated vision system ⋮ Two linear-time algorithms for computing the minimum length polygon of a digital contour ⋮ Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour

This page was built for publication: Minimum-Perimeter Polygons of Digitized Silhouettes