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
Function-mapping on defective nano-crossbars with enhanced reliability
TL;DR: The maximal rectangular regions in the crossbar that are devoid of any defects are identified and can be reliably used for mapping Boolean functions and are observed to outperforms earlier approaches for crossbars with clustered defects.
Book ChapterDOI
Optimal CREW-PRAM Algorithms for Direct Dominance Problems
TL;DR: An algorithm for the maximum empty rectangle problem is presented, which is work optimal in the expected case.
Book ChapterDOI
Computing a largest empty arbitrary oriented rectangle: theory and implementation
TL;DR: The theory and implementation of an O(n3) algorithm for computing the largest empty rectangle of arbitrary orientation for a given set of n points in the plane is reported on.
Proceedings ArticleDOI
Wot the L: Analysis of Real versus Random Placed Nets, and Implications for Steiner Tree Heuristics
TL;DR: It is shown that a pointset attribute which is called L-ness highlights the difference between real placements and random placements of net pins, and an improved lookup table-based RSMT cost estimator is presented that includes an L-nesses parameter.
Journal ArticleDOI
Computational Geometry Column 69
Adrian Dumitrescu,Minghui Jiang +1 more
TL;DR: This work revisits the following problem called Maximum Empty Box, and presents a maximum-volume axis-parallel box that is contained in U but contains no points of S in its interior.
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.