Largest unit rectangles inscribed in a convex polygon
From MaRDI portal
Publication:6639378
DOI10.1016/j.comgeo.2024.102135MaRDI QIDQ6639378
Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
Publication date: 15 November 2024
Published in: Computational Geometry (Search for Journal in Brave)
optimizationconvex polygonsoutput-sensitive algorithmtime algorithminscribed unit rectanglesunit rectangles
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Unnamed Item
- Largest inscribed rectangles in convex polygons
- Hierarchical decompositions and circular ray shooting in simple polygons
- Maximum-area triangle in a convex polygon, revisited
- Maximum-area and maximum-perimeter rectangles in polygons
- Finding largest rectangles in convex polygons
- A polynomial solution for the Potato-peeling problem
- Geometric applications of a matrix-searching algorithm
- On the computational geometry of pocket machining
- Largest triangles in a polygon
- Coverage for robotics -- a survey of recent results
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
- Aperture-angle and Hausdorff-approximation of convex figures
- Inscribing or circumscribing a histogon to a convex polygon
This page was built for publication: Largest unit rectangles inscribed in a convex polygon
