Pages that link to "Item:Q5640754"
From MaRDI portal
The following pages link to Minimum-Perimeter Polygons of Digitized Silhouettes (Q5640754):
Displayed 16 items.
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- On generalized predictive compression of continuous-time signal samples (Q595608) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Digital and cellular convexity (Q1164431) (← links)
- Fault diagnosis based on comprehensive geometric characteristic and probability neural network (Q1644097) (← links)
- On piecewise linear approximation of planar Jordan curves (Q1891049) (← links)
- A polygonal approximation for general 4-contours corresponding to weakly simple curves (Q2127283) (← links)
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects (Q2210520) (← links)
- Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model (Q3003522) (← links)
- Dynamic Minimum Length Polygon (Q3003536) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- New approach for automated inspection and feedback control systems (Q4306416) (← links)
- Moment-based methods for polygonal approximation of digitized curves (Q5959613) (← links)
- A method for vertex recognition in an automated vision system (Q5961716) (← links)