Largest inscribed rectangles in convex polygons
From MaRDI portal
Publication:450533
DOI10.1016/J.JDA.2012.01.002zbMATH Open1247.68321OpenAlexW1977740129MaRDI QIDQ450533FDOQ450533
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
Recommendations
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
Cited In (11)
- 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
- Computing and Combinatorics
- Inner and outer approximation of convex sets using alignment
- Largest unit rectangles inscribed in a convex polygon
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- Title not available (Why is that?)
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)