The following pages link to (Q4038728):
Displaying 10 items.
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Computing a maximum axis-aligned rectangle in a convex polygon (Q1334640) (← links)
- Approximate matching of polygonal shapes (Q1924770) (← links)
- Shape matching under rigid motion (Q1947970) (← links)
- Aligning two convex figures to minimize area or perimeter (Q2428667) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
