On the maximum empty rectangle problem
From MaRDI portal
Publication:796307
DOI10.1016/0166-218X(84)90124-0zbMath0543.68057OpenAlexW1992268357MaRDI QIDQ796307
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(84)90124-0
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (36)
A note on finding a maximum empty rectangle ⋮ On the minimum-area rectangular and square annulus problem ⋮ Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data ⋮ On finding a widest empty 1-corner corridor ⋮ A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ On Computing a Largest Empty Arbitrarily Oriented Rectangle ⋮ An efficient algorithm for maxdominance, with applications ⋮ On the size of the largest empty box amidst a point set ⋮ A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation ⋮ Fast sequential and parallel algorithms for finding the largest rectangle separating two sets ⋮ A note on minimal dispersion of point sets in the unit cube ⋮ Mining for empty spaces in large data sets. ⋮ On finding an empty staircase polygon of largest area (width) in a planar point-set ⋮ Faster algorithms for largest empty rectangles and boxes ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ On the largest empty axis-parallel box amidst \(n\) points ⋮ Polynomial Time Algorithms for Bichromatic Problems ⋮ Empty squares in arbitrary orientation among points ⋮ An Upper Bound of the Minimal Dispersion via Delta Covers ⋮ A note on the dispersion of admissible lattices ⋮ The minimal \(k\)-dispersion of point sets in high dimensions ⋮ Finding the largest area axis-parallel rectangle in a polygon ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Efficient algorithms for the largest rectangle problem ⋮ Finding a largest rectangle inside a digital object and rectangularization ⋮ A lower bound for the dispersion on the torus ⋮ An efficient algorithm for computing the maximum empty rectangle in three dimensions ⋮ A new algorithm for the largest empty rectangle problem ⋮ Fast parallel algorithms for the maximum empty rectangle problem. ⋮ Maximal Empty Boxes Amidst Random Points ⋮ Maximal empty coboids among points and blocks ⋮ Cutting rectangles avoiding rectangular defects ⋮ Maximal strips data structure to represent free space on partially reconfigurable FPGAs ⋮ Unnamed Item ⋮ Mining maximal frequent rectangles
Cites Work
This page was built for publication: On the maximum empty rectangle problem
