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
Efficient algorithms for the largest rectangle problem
TL;DR: Some efficient algorithms for the largest rectangle problem are presented that run in O ( nlogn + K ) time for all three problems and the worst-case running time is O (n 2 ) time.
Book ChapterDOI
Location of the Largest Empty Rectangle among Arbitrary Obstacles
TL;DR: This paper outlines the following generalization of the classical maximal-empty-rectangle problem: given n arbitrarily-oriented non-intersecting line segments of finite length on a rectangular floor, locate an empty isothetic rectangle of maximum area and the earlier restriction on isotheticity of the obstacles is relaxed.
Proceedings Article
The Bichromatic Rectangle Problem in High Dimensions.
Jonathan Backer,J. Mark Keil +1 more
TL;DR: This work shows how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as possible and proves asymptotically tight bounds on this quantity in the worst case.
Journal ArticleDOI
An in-place min-max priority search tree
TL;DR: The min-max priority search tree is introduced which is a combination of a binary search tree and a min- max heap and all the standard queries which can be done in two separate versions of apriority search tree can be performed within the same time bounds as for the original prioritysearch tree.
Journal ArticleDOI
On finding an empty staircase polygon of largest area (width) in a planar point-set
TL;DR: An algorithm for identifying a maximal empty-staircase-polygon (MESP) of largest area, among a set of n points on a rectangular floor, is presented and an improved algorithm is developed that identifies the largest MESP in O(n2) time and space.
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.