A note on finding a maximum empty rectangle

DOI10.1016/0166-218X(86)90071-5zbMath0598.05018MaRDI QIDQ1079570

Mikhail J. Atallah, Greg N. Frederickson

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum empty rectangle problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of finite geometries (05B25) Discrete mathematics in relation to computer science (68R99)

Related Items

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data, Fast algorithms for finding disjoint subsequences with extremal densities, An efficient algorithm for maxdominance, with applications, Fast sequential and parallel algorithms for finding the largest rectangle separating two sets, Mining for empty spaces in large data sets., On the largest empty axis-parallel box amidst \(n\) points, Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions, On the number of maximum empty boxes amidst \(n\) points, Efficient algorithms for the largest rectangle problem, 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, Unnamed Item

Cites Work

• On the maximum empty rectangle problem
• Maintenance of configurations in the plane
• Unnamed Item