Minimum-Perimeter Polygons of Digitized Silhouettes
From MaRDI portal
Publication:5640754
DOI10.1109/TC.1972.5008948zbMATH Open0232.68040MaRDI QIDQ5640754FDOQ5640754
Authors: Jack Sklansky, R. L. Chazin, Bruce J. Hansen 
Publication date: 1972
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Cited In (17)
- 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
- Moment-based methods for polygonal approximation of digitized curves
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
- Fault diagnosis based on comprehensive geometric characteristic and probability neural network
- On generalized predictive compression of continuous-time signal samples
- On piecewise linear approximation of planar Jordan curves
- New approach for automated inspection and feedback control systems
- Combining topological maps, multi-label simple points, and minimum-length polygons for efficient digital partition model
- Digital and cellular convexity
- Relative convex hulls in semi-dynamic arrangements
- 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
- Connectivity augmentation in planar straight line graphs
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- Dynamic minimum length polygon
- A method for vertex recognition in an automated vision system
This page was built for publication: Minimum-Perimeter Polygons of Digitized Silhouettes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640754)
