Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Introduction to algorithms
Journal of Algorithms
An efficient algorithm for the Euclidean two-center problem
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A near-linear algorithm for the planar 2-center problem
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear p-piercing problems
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
An Expander-Based Approach to Geometric Optimization
SIAM Journal on Computing
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Constrained Square-Center Problems
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Geometric optimization and computational complexity (algebra, algorithms, robotics)
Geometric optimization and computational complexity (algebra, algorithms, robotics)
Bichromatic 2-center of pairs of points
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |
In this paper we consider several variants of the discrete 2- center problem. The problem is: Given a set S of n demand points and a set C of m supply points, find two "minimal" axis-parallel squares (or rectangles) centered at the points of C that cover all the points of S. We present efficient solutions for both the static and dynamic versions of the problem (i.e. points of S are allowed to be inserted or deleted) and also consider the problem in fixed d, d ≥ 3 dimensional space. For the static version in the plane we give an optimal algorithm.