On Computing a Largest Empty Arbitrarily Oriented Rectangle
From MaRDI portal
Publication:4818583
DOI10.1142/S0218195903001153zbMATH Open1093.68132OpenAlexW2152446315MaRDI QIDQ4818583FDOQ4818583
Authors:
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Linear Programming in Linear Time When the Dimension Is Fixed
- Computing largest empty circles with location constraints
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Finding minimal enclosing boxes
- Finding the largest area axis-parallel rectangle in a polygon
- Computing the Largest Empty Rectangle
- A new algorithm for the largest empty rectangle problem
- On the maximum empty rectangle problem
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
Cited In (9)
- Title not available (Why is that?)
- Finding a largest rectangle inside a digital object and rectangularization
- Empty squares in arbitrary orientation among points
- Finding the largest separating rectangle among two point sets
- On finding widest empty curved corridors
- Faster algorithms for largest empty rectangles and boxes
- Empty squares in arbitrary orientation among points
- THE LARGEST EMPTY ANNULUS PROBLEM
- Variations of largest rectangle recognition amidst a bichromatic point set
This page was built for publication: On Computing a Largest Empty Arbitrarily Oriented Rectangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818583)