The following pages link to (Q3123572):
Displaying 9 items.
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
- Non-greedy optimal digital convex polygons (Q1355686) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- (Q4022672) (← links)
- (Q4211494) (← links)
- (Q4763392) (← links)
- (Q4953527) (← links)
- Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time (Q6103065) (← links)
