Largest inscribed rectangles in convex polygons

DOI10.1016/j.jda.2012.01.002zbMath1247.68321OpenAlexW1977740129MaRDI QIDQ450533

Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.01.002

zbMATH Keywords

geometric algorithmsapproximation algorithmsinscribed rectangles in polygonslargest area rectangle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items

Maximum-area and maximum-perimeter rectangles in polygons, An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest, Inner and outer approximation of convex sets using alignment, Largest area parallelogram inside a digital object in a triangular grid, Finding largest rectangles in convex polygons, Finding the largest area rectangle of arbitrary orientation in a closed contour

Cites Work

• Unnamed Item
• Finding the largest area axis-parallel rectangle in a polygon
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Finding large sticks and potatoes in polygons
• Largest empty rectangle among a point set