On Computing a Largest Empty Arbitrarily Oriented Rectangle

DOI10.1142/S0218195903001153zbMath1093.68132OpenAlexW2152446315MaRDI QIDQ4818583

No author found.

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195903001153

zbMATH Keywords

algorithmgeometric optimizationlargest empty rectanglecontinuous optimization problem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

On finding widest empty curved corridors ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Finding a largest rectangle inside a digital object and rectangularization ⋮ Finding the largest separating rectangle among two point sets

Cites Work

• A new algorithm for the largest empty rectangle problem
• Finding the largest area axis-parallel rectangle in a polygon
• On the maximum empty rectangle problem
• Computing largest empty circles with location constraints
• Finding minimal enclosing boxes
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• Computing the Largest Empty Rectangle
• Linear Programming in Linear Time When the Dimension Is Fixed
• Determining the minimum-area encasing rectangle for an arbitrary closed curve

This page was built for publication: On Computing a Largest Empty Arbitrarily Oriented Rectangle