Pages that link to "Item:Q1265324"
From MaRDI portal
The following pages link to Optimal placement of convex polygons to maximize point containment (Q1265324):
Displaying 10 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- Maximizing the overlap of two planar convex sets under rigid motions (Q871058) (← links)
- Largest empty circle centered on a query line (Q972354) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- A mixed integer formulation for maximal covering by inclined parallelograms (Q1876161) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
- Covering Polygons with Rectangles (Q2988828) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
