On the maximum empty rectangle problem
TLDR
In this article, the authors considered the problem of finding a maximum area rectangle that is fully contained in a given rectangle A and does not contain any point of S in its interior.About:
This article is published in Discrete Applied Mathematics.The article was published on 1984-07-01 and is currently open access. It has received 111 citations till now. The article focuses on the topics: Largest empty rectangle & Rectangle method.read more
Citations
More filters
Journal ArticleDOI
Computational Geometry Column 60
Adrian Dumitrescu,Minghui Jiang +1 more
TL;DR: This column is devoted to maximal empty axis-parallel rectangles amidst a point set, and among these, maximum-area rectangles are of interest.
Posted Content
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location
TL;DR: This paper study's the query version of the largest empty space recognition problem, where a set of n points P is given in a bounded 2D region and the objective is to preprocess P such that given any arbitrary query point q, the largestempty region of some desired shape that contains q but does not contain any point in P can be reported efficiently.
Proceedings ArticleDOI
Age-aware Logic and Memory Co-Placement for RRAM-FPGAs
TL;DR: An age-aware placement framework for RRAM-FPGAs with uniform reconfigurable logic/memory units, consisting of a dynamic reconfiguration region allocation algorithm and a logic/ memory co-placement algorithm, that balances write distributions across the entire FPGA according to logic and memory write frequency differences.
Posted Content
Finding the Maximal Empty Rectangle Containing a Query Point
Haim Kaplan,Micha Sharir +1 more
TL;DR: An algorithm to preprocess a set of points in an axis-parallel rectangle into a data structure of size O(n\alpha(n)\log^3 n)$, such that, given a query point, it can find the largest-area axis-Parallel rectangle that is contained in B, which contains no point of P.
Journal ArticleDOI
Maximal Empty Boxes Amidst Random Points
Adrian Dumitrescu,Minghui Jiang +1 more
TL;DR: It is shown that the expected number of maximal empty axis-parallel boxes amidst n random points in the unit hypercube [0,1]d in R is (1 ± o(1)) $\frac{(2d-2)!}{(d-1)!}$n lnd−1n, if d is fixed.
References
More filters
Journal ArticleDOI
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
TL;DR: A mmmaal spammuag tree for P can be derived from a Voronot diagram for P m hnear tmae by using prewously known results.
Journal ArticleDOI
Voronoi Diagrams in L1 (L∞) Metrics with 2-Dimensional Storage Applications
Der-Tsai Lee,C. K. Wong +1 more
TL;DR: It is shown in this paper that there exists a natural isometry between the L_1 and L_\infty metrics, which implies the existence of a polynomial time algorithm for the OPP in one metric and the existence for the same problem in the other metric.
Generalization of heaps and its applications
TL;DR: A data structure called "generalized heap," which is designed primarily to maintain the solutions of a certain group of problems while the data set is changing over time, is introduced.