Minimum Separating Circle for Bichromatic Points in the Plane
- Resource Type
- Conference
- Authors
- Bitner, Steven; Cheung, Yam; Daescu, Ovidiu
- Source
- 2010 International Symposium on Voronoi Diagrams in Science and Engineering Voronoi Diagrams in Science and Engineering (ISVD), 2010 International Symposium on. :50-55 Jun, 2010
- Subject
- Computing and Processing
Explosives
Computer science
Military communication
Wireless communication
Solids
set separation
bichromatic separation
circular separation
Voronoi diagram
- Language
Consider two point sets in the plane, a red set of size n, and a blue set of size m. In this paper we show how to find the minimum separating circle, which is the smallest circle that contains all points of the red set and as few points as possible of the blue set in its interior. If multiple minimum separating circles exist our algorithm finds all of them. We also give an exact solution for finding the largest separating circle that contains all points of the red set and as few points as possible of the blue set in its interior. Our solutions make use of the farthest neighbor Voronoi Diagram of point sites.