Open AccessJournal Article
On Maximum Empty Rectangle Problem
A. Naamad,W.L.Hsu,Der-Tsai Lee +2 more
TLDR
It is shown that if the points of S are drawn randomly and independently from A , the problem can be solved in O( n (log n ) 2 ) expected time.About:
This article is published in Discrete Applied Mathematics.The article was published on 1984-01-01 and is currently open access. It has received 110 citations till now. The article focuses on the topics: Largest empty rectangle.read more
Citations
More filters
Journal ArticleDOI
Computational Geometry—A Survey
TL;DR: The state of the art of computational geometry is surveyed, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms.
Proceedings ArticleDOI
Fast algorithms for computing the largest empty rectangle
Alok Aggarwal,Subhash Suri +1 more
TL;DR: The first algorithm for computing the largest-area empty rectangle is optimal within a multiplicative constant and the two algorithms for computing such a rectangle can be modified to compute thelargest-perimeter rectangle in memory space.
Proceedings ArticleDOI
Image segmentation by shape-directed covers
TL;DR: A technique for image segmentation using shape-directed covers is described and applied to the fully automatic analysis of complex printed-page layouts, which for some tasks is superior to strategies currently emphasized in the literature, including bottom-up and top-down.
Journal ArticleDOI
A new algorithm for the largest empty rectangle problem
TL;DR: A new simple algorithm for the so-called largest empty rectangle problem, i.e., the problem of finding a maximum area rectangle contained inA and not containing any point ofS in its interior, is presented.
Proceedings ArticleDOI
Small-size ε-nets for axis-parallel rectangles and boxes
TL;DR: Improved approximation factors are obtained for the hitting set or the set cover problems associated with the corresponding range spaces for ε-nets of size O(1/ε log log log 1/ε) for planar point sets and axis-parallel rectangular ranges.
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.