Pages that link to "Item:Q2428667"
From MaRDI portal
The following pages link to Aligning two convex figures to minimize area or perimeter (Q2428667):
Displayed 11 items.
- A generalization of the convex Kakeya problem (Q486985) (← links)
- 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)
- The minimum convex container of two convex polytopes under translations (Q1622345) (← links)
- Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
- Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
- Bundling Two Simple Polygons to Minimize Their Convex Hull (Q2980899) (← links)
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons (Q3452765) (← links)
- A Dynamical Systems Approach for the Shape Matching of Polytopes Along Rigid-Body Motions (Q5155605) (← links)
- The frechet distance revisited and extended (Q5404460) (← links)
- Universal convex covering problems under translations and discrete rotations (Q6060891) (← links)