Computing all large sums-of-pairs in ℝn and the discrete planar two-watchtower problem

Boaz Ben-Moshe; Paz Carmi; Matthew J. Katz

doi:10.1016/j.ipl.2003.07.008

Computing all large sums-of-pairs in ℝⁿ and the discrete planar two-watchtower problem

Boaz Ben-Moshe
, Paz Carmi
, Matthew J. Katz

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	137-139
Number of pages	3
Journal	Information Processing Letters
Volume	89
Issue number	3
DOIs	https://doi.org/10.1016/j.ipl.2003.07.008
State	Published - 14 Feb 2004
Externally published	Yes

Keywords

Algorithms
Computational geometry
Facility location

Access to Document

10.1016/j.ipl.2003.07.008

Cite this

@article{1d22f3972ca3421b9f64b5b8e99841c1,

title = "Computing all large sums-of-pairs in ℝn and the discrete planar two-watchtower problem",

abstract = "The application of Matou{\v s}ek's algorithm to compute all pairs of rows in X in an n{\texttimes}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.",

keywords = "Algorithms, Computational geometry, Facility location",

author = "Boaz Ben-Moshe and Paz Carmi and Katz, \{Matthew J.\}",

note = "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).",

year = "2004",

month = feb,

day = "14",

doi = "10.1016/j.ipl.2003.07.008",

language = "אנגלית",

volume = "89",

pages = "137--139",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "3",

}

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 - https://www.scopus.com/pages/publications/0346724324

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 -

Computing all large sums-of-pairs in ℝⁿ and the discrete planar two-watchtower problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this