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

Authors:
Po-Hsueh Huang;Yin Te Tsai;Chuan Yi Tang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan, Republic of China;Department of Computer Science and Information Management, Providence University, Shalu, Taichung 433, Taiwan, Republic of China;Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan, Republic of China
Venue:
Information Processing Letters
Year:
2003

Citing 12
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Finding tailored partitions

Journal of Algorithms
An expander-based approach to geometric optimization

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A faster algorithm for the two-center decision problem

Information Processing Letters
A sweepline algorithm to solve the two-center problem

Information Processing Letters
An efficient algorithm for the Euclidean two-center problem

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A near-linear algorithm for the planar 2-center problem

Proceedings of the twelfth annual symposium on Computational geometry
Faster construction of planar two-centers

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
More planar two-center algorithms

Computational Geometry: Theory and Applications
Computational geometry.

Computational geometry.

Solving the constrained p-center problem using heuristic algorithms

Applied Soft Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

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(n2 log2 n) algorithm for solving this problem is also presented.