Computing the Largest Empty Rectangle
From MaRDI portal
Publication:3747743
DOI10.1137/0215022zbMath0608.68059OpenAlexW2007986693MaRDI QIDQ3747743
No author found.
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215022
optimizationlocation theoryVoronoi diagramcomputational geometrydivide-and-conquerfree treelargest area subrectangle
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (37)
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 ⋮ A note on the largest empty rectangle problem ⋮ A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids ⋮ Fast algorithms for finding disjoint subsequences with extremal densities ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Geometric applications of a matrix-searching algorithm ⋮ The orthogonal convex skull problem ⋮ On Computing a Largest Empty Arbitrarily Oriented Rectangle ⋮ An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation ⋮ An efficient algorithm for maxdominance, with applications ⋮ 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 ⋮ Applications of generalized matrix searching to geometric algorithms ⋮ The minimal \(k\)-dispersion of point sets in high dimensions ⋮ Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions ⋮ Sequential and parallel algorithms for finding a maximum convex polygon ⋮ 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 ⋮ Anchored rectangle and square packings ⋮ On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips ⋮ 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 ⋮ Unnamed Item
This page was built for publication: Computing the Largest Empty Rectangle
