Pages that link to "Item:Q1364368"
From MaRDI portal
The following pages link to Multiple translational containment. I: An approximate algorithm (Q1364368):
Displayed 9 items.
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Bundling three convex polygons to minimize area or perimeter (Q902419) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- A new algorithm for the two-polygon containment problem (Q1373882) (← links)
- Densest translational lattice packing of non-convex polygons (Q1602949) (← links)
- The minimum convex container of two convex polytopes under translations (Q1622345) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- Bundling Two Simple Polygons to Minimize Their Convex Hull (Q2980899) (← links)