On k-hulls and related problems
SIAM Journal on Computing
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
A convex hull algorithm for discs, and applications
Computational Geometry: Theory and Applications
Algorithms for weak and wide separation of sets
Discrete Applied Mathematics
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
ACM Computing Surveys (CSUR)
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Handbook of discrete and computational geometry
Principles of data mining
The Maximum Box Problem and its Application to Data Analysis
Computational Optimization and Applications
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Low-Dimensional Linear Programming with Violations
SIAM Journal on Computing
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Covering point sets with two disjoint disks or squares
Computational Geometry: Theory and Applications
On Approximating the Depth and Related Problems
SIAM Journal on Computing
Bichromatic separability with two boxes: A general approach
Journal of Algorithms
Covering Many or Few Points with Unit Disks
Theory of Computing Systems
Proceedings of the twenty-sixth annual symposium on Computational geometry
On the coarseness of bicolored point sets
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Let P be a set of n points in the plane in general position such that its elements are colored red or blue. We study the problem of finding two disjoint disks D"r and D"b such that D"r covers only red points, D"b covers only blue points, and the number of elements of P contained in D"r@?D"b is maximized. We prove that this problem can be solved in O(n^1^1^/^3polylogn) time. We also present a randomized algorithm that with high probability returns a (1-@e)-approximation to the optimal solution in O(n^4^/^3@e^-^6polylogn) time.