|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2010 International Symposium on Voronoi Diagrams in Science and Engineering
Minimum Separating Circle for Bichromatic Points in the Plane
Quebec, Canada
June 28-June 30
ISBN: 978-0-7695-4112-9
| ASCII Text | x | ||
| Steven Bitner, Yam Cheung, Ovidiu Daescu, "Minimum Separating Circle for Bichromatic Points in the Plane," 2010 International Symposium on Voronoi Diagrams in Science and Engineering, pp. 50-55, 2010 International Symposium on Voronoi Diagrams in Science and Engineering, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/ISVD.2010.14, author = {Steven Bitner and Yam Cheung and Ovidiu Daescu}, title = {Minimum Separating Circle for Bichromatic Points in the Plane}, journal ={2010 International Symposium on Voronoi Diagrams in Science and Engineering}, volume = {0}, year = {2010}, isbn = {978-0-7695-4112-9}, pages = {50-55}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISVD.2010.14}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2010 International Symposium on Voronoi Diagrams in Science and Engineering TI - Minimum Separating Circle for Bichromatic Points in the Plane SN - 978-0-7695-4112-9 SP50 EP55 A1 - Steven Bitner, A1 - Yam Cheung, A1 - Ovidiu Daescu, PY - 2010 KW - set separation KW - bichromatic separation KW - circular separation KW - Voronoi diagram VL - 0 JA - 2010 International Symposium on Voronoi Diagrams in Science and Engineering ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVD.2010.14
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.
Index Terms:
set separation, bichromatic separation, circular separation, Voronoi diagram
Citation:
Steven Bitner, Yam Cheung, Ovidiu Daescu, "Minimum Separating Circle for Bichromatic Points in the Plane," isvd, pp.50-55, 2010 International Symposium on Voronoi Diagrams in Science and Engineering, 2010
Usage of this product signifies your acceptance of the Terms of Use.