Copyright © 2003 Elsevier B.V. All rights reserved.
Computing all large sums-of-pairs in
and the discrete planar two-watchtower problem*1
Received 29 May 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We observe that Matou
ek's algorithm for computing all dominances for a set
of n points in
can be employed for computing all pairs of points in such a set whose sum is greater or equal to a given point
. We apply this observation to the decision problem of the discrete planar two-watchtower problem and obtain an improved solution.
Author Keywords: Algorithms; Computational geometry; Facility location







E-mail Article
Add to my Quick Links

Cited By in Scopus (3)






