Pages that link to "Item:Q2489540"
From MaRDI portal
The following pages link to Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540):
Displaying 11 items.
- Inner and outer approximation of convex sets using alignment (Q331974) (← links)
- Overlap of convex polytopes under rigid motion (Q390361) (← links)
- Largest inscribed rectangles in convex polygons (Q450533) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Finding largest rectangles in convex polygons (Q902427) (← links)
- Approximating a planar convex set using a sparse grid (Q2274483) (← links)
- Aligning two convex figures to minimize area or perimeter (Q2428667) (← links)
- Computing and Combinatorics (Q4681184) (← links)
- Geometric optimization and sums of algebraic functions (Q5501958) (← links)
- Largest area parallelogram inside a digital object in a triangular grid (Q6166835) (← links)
- Largest unit rectangles inscribed in a convex polygon (Q6639378) (← links)
