A fast algorithm for the alpha-connected two-center decision problem

✍ Scribed by Po-Hsueh Huang; Yin Te Tsai; Chuan Yi Tang

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 90 KB
• Volume: 85
• Category: Article
• ISSN: 0020-0190
• DOI: 10.1016/s0020-0190(02)00402-7

✦ Synopsis

This paper considers the problem of determining whether a set of points can be covered by two discs with centers p and q and common radius r, such that the ratio d(p, q)/r is bounded below by a specified constant, α. An O(n 2 log 2 n) algorithm for solving this problem is also presented.