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
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
TL;DR: In this paper, an incremental quasi-polynomial time algorithm for generating all maximal integer feasible solutions for a given monotone system of separable inequalities, for generating p-inefficient points of a given discrete probability distribution, and for generating maximal hyper-rectangles which contain a specified fraction of points in a given set in R^n.
Journal ArticleDOI
Variations of largest rectangle recognition amidst a bichromatic point set
TL;DR: In this paper, an in-place version of the k-d tree for a set of n points in R k supports orthogonal range counting query using O( 1 ) extra workspace, and with O( n 1 − 1 ∕ k ) query time complexity.
Book ChapterDOI
Geometric location problems and their complexity
TL;DR: A collection of geometric location problems in the plane and their associated time complexity can be formulated as optimization problems, but geometric properties are exploited to obtain efficient solutions.
Proceedings ArticleDOI
Reliable logic design with defective nano-crossbar architecture
TL;DR: This work uses an efficient search technique based on defect geometry to determine a large rectangular region that can be reliably used for mapping Boolean functions and reports experimental results by varying crossbar-size and defect-density.
Posted Content
Maximum Area Rectangle Separating Red and Blue Points
Bogdan Armaselu,Ovidiu Daescu +1 more
TL;DR: This work addresses the planar, axis-aligned (2D) version of the rectangle-finding algorithm, and presents an O(mlogm+n) time, O(m-n) space algorithm, which is optimal in the decision model of computation.
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.