Computing all large sums-of-pairs in R n and the discrete planar two-watchtower problem Academic Article uri icon

abstract

  • We observe that Matousek's algorithm for computing all dominances for a set P of n points in Rn can be employed for computing all pairs of points in such a set whose sum is greater or equal to a given point a ∈ Rn. We apply this observation to the decision problem of the discrete planar two-watchtower problem and obtain an improved solution.

publication date

  • January 1, 2004