Largest empty rectangle among a point set
From MaRDI portal
Publication:4419481
DOI10.1016/S0196-6774(02)00285-7zbMATH Open1043.65035OpenAlexW2046334944MaRDI QIDQ4419481FDOQ4419481
Authors: Jeet Chaudhuri, Sandip Das, Subhas C. Nandy 
Publication date: 13 August 2003
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00285-7
Recommendations
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Cited In (22)
- Polynomial time algorithms for bichromatic problems
- Title not available (Why is that?)
- On the minimum-area rectangular and square annulus problem
- Largest empty circle centered on a query line
- Title not available (Why is that?)
- On finding a widest empty 1-corner corridor
- Empty squares in arbitrary orientation among points
- Planar maximum-box problem revisited
- Largest area parallelogram inside a digital object in a triangular grid
- Mining for empty spaces in large data sets.
- A new algorithm for the largest empty rectangle problem
- On the maximum empty rectangle problem
- A note on finding a maximum empty rectangle
- Finding the largest separating rectangle among two point sets
- Largest inscribed rectangles in convex polygons
- Empty pseudo-triangles in point sets
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- Title not available (Why is that?)
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- Variations of largest rectangle recognition amidst a bichromatic point set
- Computing the Largest Empty Rectangle
This page was built for publication: Largest empty rectangle among a point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419481)
