By Topic

Minimizing the Number of Separating Circles for Two Sets of Points in the Plane

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Jiaye Wang ; Dept. of Comput. Sci., Shandong Econimical Univ., Jinan, China ; Feng Sun ; Wenping Wang ; Chunyan Miao
more authors

Given two sets of points ℝ and B in the plane, we address the problem of finding a set of circles ℂ = {ci, i = 1, 2,... ,k}, satisfying the condition that every point in ℝ is covered by at least one circle in ℂ and each point in B is not covered by any circle in ℂ. We conjecture that to find such a set with the smallest k is NP-hard. In this paper, we present an approximation algorithm for computing the set with minimal number of such circles. The algorithm finds also a lower bound of the smallest k.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2011 Eighth International Symposium on

Date of Conference:

28-30 June 2011