The Largest Empty Annulus Problem
نویسندگان
چکیده
Given a set of n points S in the Euclidean plane, we address the problem of computing an annulus A, (open region between two concentric circles) of largest width, that partitions S into a subset of points inside and a subset of points outside the circles, such that no point p ∈ S lies in the interior of A. This problem can be considered as a maximin facility location problem for n points such that the facility is a circumference. We give a characterization of the centres of annuli which are locally optimal and we show that the problem can be solved in O(n log n) time and O(n) space. We also consider the case in which the number of points in the inner circle is a fixed value k. When k ∈ O(n) our algorithm runs in O(n log n) time and O(n) space, furthermore, we can simultaneously optimize for all values of k within the same time bound. When k is small, that is a fixed constant, we can solve the problem in O(nlogn) time and O(n) space.
منابع مشابه
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 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...
متن کامل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...
متن کامل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 ...
متن کاملThe Largest Empty Circle Problem
The largest empty circle (LEC) problem is defined on a set P and consists of finding the largest circle that contains no points in P and is also centered inside the convex hull of P . The LEC is always centered at either a vertex on the Voronoi diagram for P or on an intersection between a Voronoi edge and the convex hull of P . Thus, finding the LEC consists of constructing a Voronoi diagram a...
متن کامل