Pages that link to "Item:Q527417"
From MaRDI portal
The following pages link to Approximating the maximum overlap of polygons under translation (Q527417):
Displaying 10 items.
- Computing the maximum overlap of two convex polygons under translations (Q1271283) (← links)
- Improved upper bounds in the moving sofa problem (Q1621477) (← links)
- Maximum overlap of convex polytopes under translation (Q1941219) (← links)
- Approximating a planar convex set using a sparse grid (Q2274483) (← links)
- Maximum overlap and minimum convex hull of two convex polyhedra under translations (Q2483561) (← links)
- Matching sets of line segments (Q2662685) (← links)
- Overlap of Convex Polytopes under Rigid Motion (Q2957524) (← links)
- Placing Text Boxes on Graphs (Q3611861) (← links)
- Algorithm Theory - SWAT 2004 (Q5315366) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q6487432) (← links)