Pages that link to "Item:Q1271283"
From MaRDI portal
The following pages link to Computing the maximum overlap of two convex polygons under translations (Q1271283):
Displaying 12 items.
- Overlap of convex polytopes under rigid motion (Q390361) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
- Translational packing of arbitrary polytopes (Q1005325) (← links)
- Probabilistic matching of planar regions (Q1037777) (← links)
- Shape matching under rigid motion (Q1947970) (← links)
- Aligning two convex figures to minimize area or perimeter (Q2428667) (← links)
- Maximum overlap and minimum convex hull of two convex polyhedra under translations (Q2483561) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) (← links)
