Largest unit rectangles inscribed in a convex polygon

DOI10.1016/J.COMGEO.2024.102135MaRDI QIDQ6639378zbMATH OpenFDO

Authors 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)

zbMATH Keywords

optimizationconvex polygonsoutput-sensitive algorithmtime algorithminscribed unit rectanglesunit rectangles

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Finding largest rectangles in convex polygons
• Largest inscribed rectangles in convex polygons
• Maximum-area and maximum-perimeter rectangles in polygons
• Finding the largest area rectangle of arbitrary orientation in a closed contour
• Finding the largest area axis-parallel rectangle in a polygon

Cites work

• A polynomial solution for the Potato-peeling problem
• Computational geometry. Algorithms and applications.
• Coverage for robotics -- a survey of recent results
• Finding largest rectangles in convex polygons
• Geometric applications of a matrix-searching algorithm
• Hierarchical decompositions and circular ray shooting in simple polygons
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Inscribing or circumscribing a histogon to a convex polygon
• Largest inscribed rectangles in convex polygons
• Largest triangles in a polygon
• Maximum-area and maximum-perimeter rectangles in polygons
• Maximum-area triangle in a convex polygon, revisited
• On the computational geometry of pocket machining

This page was built for publication: Largest unit rectangles inscribed in a convex polygon

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