Largest Empty Axis-Parallel Rectangular Annulus
نویسنده
چکیده
In Euclidean plane, a rectangular annulus is the region between parallel rectangles such that the smaller rectangle lies wholly inside the outer rectangle. Given a set P of n points in the two dimensional plane, we propose O(n) time and O(n) space algorithm to identify an axis-parallel largest empty annulus amidst the points of P . We are not aware of any published work on this problem. To the best of our knowledge this is the first O(n) algorithm for recognition largest empty annulus.
منابع مشابه
Maximum-width Axis-Parallel Empty Rectangular Annulus
Given a set P of n points on R, we address the problem of computing an axis-parallel empty rectangular annulus A of maximumwidth such that no point of P lies inside A but all points of P must lie inside, outside and on the boundaries of two parallel rectangles forming the annulus A. We propose an O(n) time and O(n) space algorithm to solve the problem. In a particular case when the inner rectan...
متن کاملInplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle
There is a high demand of space-efficient algorithms in builtin or embedded softwares. In this paper, we consider the problem of designing space-efficient algorithms for computing the maximum area empty rectangle (MER) among a set of points inside a rectangular region R in 2D. We first propose an inplace algorithm for computing the priority search tree with a set of n points in R using O(logn) ...
متن کاملBest Fitting Rectangles
We solve an interesting optimization problem motivated by tolerancing metrology, paper position sensing, and facility location: What rectangle fits best a given set of points? This problem has relations to the minimum width annulus problem and also to the largest empty rectangle problem for both of which O(n log n) time solutions are not known. Nevertheless, for our problem there is a linear ti...
متن کاملColor Spanning Annulus: Square, Rectangle and Equilateral Triangle
In this paper, we study different variations of minimum width color-spanning annulus problem among a set of points P = {p1, p2, . . . , pn} in IR, where each point is assigned with a color in {1, 2, . . . , k}. We present algorithms for finding a minimum width color-spanning axis parallel square annulus (CSSA), minimum width color spanning axis parallel rectangular annulus (CSRA), and minimum w...
متن کاملOn the size of the largest empty box amidst a point set
The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational complexity theory. It is known that the volume of the largest empty box is of asymptotic order 1/n for n → ∞ and fixed dimension d. However, it is natural to assume that the volume of the largest empty box increases as d gets larger. In the present paper we prove that ...
متن کامل