On Computing a Largest Empty Arbitrarily Oriented Rectangle
From MaRDI portal
Recommendations
Cites work
- A new algorithm for the largest empty rectangle problem
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
- Computing largest empty circles with location constraints
- Computing the Largest Empty Rectangle
- 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
- Linear Programming in Linear Time When the Dimension Is Fixed
- On the maximum empty rectangle problem
Cited in
(9)- scientific article; zbMATH DE number 4033105 (Why is no real title available?)
- 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
- THE LARGEST EMPTY ANNULUS PROBLEM
- Empty squares in arbitrary orientation among points
- 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)