Largest inscribed rectangles in convex polygons

DOI10.1016/J.JDA.2012.01.002MaRDI QIDQ450533zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmsgeometric algorithmsinscribed rectangles in polygonslargest area rectangle

Mathematics Subject Classification ID

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

Recommendations

• Finding largest rectangles in convex polygons
• Maximum-area and maximum-perimeter rectangles in polygons
• Extremal convex polygons inscribed in a given convex polygon
• Computing and Combinatorics
• Largest triangles in a polygon

Cites work

• scientific article; zbMATH DE number 3084782 (Why is no real title available?)
• Finding large sticks and potatoes in polygons
• Finding the largest area axis-parallel rectangle in a polygon
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Largest empty rectangle among a point set

Cited in

(14)

• Maximum-area and maximum-perimeter rectangles in polygons
• Finding largest rectangles in convex polygons
• Peeling potatoes near-optimally in near-linear time
• Largest placement of one convex polygon inside another
• Largest area parallelogram inside a digital object in a triangular grid
• Finding the largest area rectangle of arbitrary orientation in a closed contour
• Inner and outer approximation of convex sets using alignment
• Computing and Combinatorics
• Largest unit rectangles inscribed in a convex polygon
• Peeling potatoes near-optimally in near-linear time
• Extremal convex polygons inscribed in a given convex polygon
• Maximum-area triangle in a convex polygon, revisited
• scientific article; zbMATH DE number 4098747 (Why is no real title available?)
• An Algorithm to Compute Any Simple k-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest

This page was built for publication: Largest inscribed rectangles in convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450533)