Maximum-area and maximum-perimeter rectangles in polygons
From MaRDI portal
Publication:827336
DOI10.1016/j.comgeo.2020.101710zbMath1468.68264OpenAlexW3089296195MaRDI QIDQ827336
Yujin Choi, Seungjun Lee, Hee-Kap Ahn
Publication date: 7 January 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2020.101710
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Largest inscribed rectangles in convex polygons
- Finding the largest area axis-parallel rectangle in a polygon
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- Finding largest rectangles in convex polygons
- A polynomial solution for the Potato-peeling problem
- The orthogonal convex skull problem
- On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
- Extremal polygon containment problems
- Computing a maximum axis-aligned rectangle in a convex polygon
- Largest placement of one convex polygon inside another
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
- Visibility and ray shooting queries in polygonal domains
- Finding large sticks and potatoes in polygons
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
This page was built for publication: Maximum-area and maximum-perimeter rectangles in polygons