Pages that link to "Item:Q1822239"
From MaRDI portal
The following pages link to Minimum area circumscribing polygons (Q1822239):
Displayed 14 items.
- Isoperimetric triangular enclosures with a fixed angle (Q375380) (← links)
- A hybrid model predictive control scheme for containment and distributed sensing in multi-agent systems (Q385424) (← links)
- Minimum-perimeter enclosures (Q963415) (← links)
- Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes (Q990126) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Simultaneous inner and outer approximation of shapes (Q1201744) (← links)
- Stock cutting to minimize cutting length (Q1266563) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Hausdorff approximation of convex polygons (Q2573338) (← links)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS (Q4762908) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)