Minimum-Perimeter Polygons of Digitized Silhouettes
From MaRDI portal
Cited in
(20)- 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
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
- 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
- New approach for automated inspection and feedback control systems
- Relative convex hulls in semi-dynamic arrangements
- On generalized predictive compression of continuous-time signal samples
- Moment-based methods for polygonal approximation of digitized curves
- A method for vertex recognition in an automated vision system
- Connectivity augmentation in planar straight line graphs
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- Border tracing in oriented adjacency graphs of polygonal tilings
- Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones
- Fast and exact convex and concave decomposition of digitized shapes
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640754)
