TY - JOUR
T1 - Computing all large sums-of-pairs in ℝn and the discrete planar two-watchtower problem
AU - Ben-Moshe, Boaz
AU - Carmi, Paz
AU - Katz, Matthew J.
N1 - Funding Information:
✩ This work has been supported by the Israel Ministry of Industry and Trade, LSRT consortium of the MAGNET program. * Corresponding author. E-mail addresses: [email protected] (B. Ben-Moshe), [email protected] (P. Carmi), [email protected] (M.J. Katz).
PY - 2004/2/14
Y1 - 2004/2/14
N2 - The application of Matoušek's algorithm to compute all pairs of rows in X in an n×n matrix was discussed. This algorithm was also applied to the discrete planar two-watchtower problem. It was found that the input to the discrete version of the planar two-watchtower problem is an x-monotone polygonal line in a 2-dimensional (polygonal) terrain.
AB - The application of Matoušek's algorithm to compute all pairs of rows in X in an n×n matrix was discussed. This algorithm was also applied to the discrete planar two-watchtower problem. It was found that the input to the discrete version of the planar two-watchtower problem is an x-monotone polygonal line in a 2-dimensional (polygonal) terrain.
KW - Algorithms
KW - Computational geometry
KW - Facility location
UR - http://www.scopus.com/inward/record.url?scp=0346724324&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2003.07.008
DO - 10.1016/j.ipl.2003.07.008
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0346724324
SN - 0020-0190
VL - 89
SP - 137
EP - 139
JO - Information Processing Letters
JF - Information Processing Letters
IS - 3
ER -