A new algorithm for the largest empty rectangle problem
From MaRDI portal
Publication:582097
DOI10.1007/BF01840377zbMath0689.68065OpenAlexW2997188414MaRDI QIDQ582097
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01840377
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)
Related Items
An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields, 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 unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids, Fast algorithms for finding disjoint subsequences with extremal densities, 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, Mining for empty spaces in large data sets., 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 efficient algorithm for computing the maximum empty rectangle in three dimensions, Fast parallel algorithms for the maximum empty rectangle problem., Maximal Empty Boxes Amidst Random Points, Maximal empty coboids among points and blocks, Maximal strips data structure to represent free space on partially reconfigurable FPGAs, An optimal algorithm for rectangle placement
Cites Work
