Minimum-perimeter enclosures
From MaRDI portal
Publication:963415
DOI10.1016/j.ipl.2008.02.007zbMath1186.68509OpenAlexW2072062957MaRDI QIDQ963415
Valentin Polishchuk, Joseph S. B. Mitchell
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.007
Related Items (7)
Structured discrete shape approximation: theoretical complexity and practical algorithm ⋮ An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ Isoperimetric triangular enclosures with a fixed angle ⋮ Sweeping an oval to a vanishing point ⋮ An algorithm to find maximum area polygons circumscribed about a convex polygon ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Cites Work
This page was built for publication: Minimum-perimeter enclosures
