Minimum area circumscribing polygons
From MaRDI portal
Publication:1822239
DOI10.1007/BF01898354zbMath0617.68040OpenAlexW1996940760MaRDI QIDQ1822239
Publication date: 1985
Published in: The Visual Computer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01898354
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52Bxx)
Related Items (14)
An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ Geometric applications of a matrix-searching algorithm ⋮ Parallel computational geometry ⋮ Isoperimetric triangular enclosures with a fixed angle ⋮ A hybrid model predictive control scheme for containment and distributed sensing in multi-agent systems ⋮ An algorithm to find maximum area polygons circumscribed about a convex polygon ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ Simultaneous inner and outer approximation of shapes ⋮ Minimum-perimeter enclosures ⋮ Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes ⋮ Stock cutting to minimize cutting length ⋮ Finding minimal convex nested polygons ⋮ Hausdorff approximation of convex polygons ⋮ EFFICIENT APPROXIMATION OF CONVEX POLYGONS
Cites Work
This page was built for publication: Minimum area circumscribing polygons