Pages that link to "Item:Q2482905"
From MaRDI portal
The following pages link to Translating a convex polygon to contain a maximum number of points. (Q2482905):
Displaying 11 items.
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← 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)
- Solution methodologies for minimizing a sum of pointwise minima of two functions (Q2679000) (← links)
- Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Minimizing Sum of Truncated Convex Functions and Its Applications (Q3391176) (← links)
