Referenced Items are not available for this document.
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
- Page(s):
- 98 - 104
- E-ISBN :
- 978-0-7695-4483-0
- Print ISBN:
- 978-1-4577-1026-1
- INSPEC Accession Number:
- 12183041
- Conference Location :
- Qingdao
- Digital Object Identifier :
- 10.1109/ISVD.2011.21
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
