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

68T10: Pattern recognition, speech recognition

Related Items

New approach for automated inspection and feedback control systems, Moment-based methods for polygonal approximation of digitized curves, A method for vertex recognition in an automated vision system, Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length, Relative convex hulls in semi-dynamic arrangements, On generalized predictive compression of continuous-time signal samples, Connectivity augmentation in planar straight line graphs, Two linear-time algorithms for computing the minimum length polygon of a digital contour, Digital and cellular convexity, Fault diagnosis based on comprehensive geometric characteristic and probability neural network, On piecewise linear approximation of planar Jordan curves, A polygonal approximation for general 4-contours corresponding to weakly simple curves, A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects, 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