Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem

DOI10.1016/j.ipl.2003.07.008zbMath1178.68606OpenAlexW1997857682MaRDI QIDQ1029066

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

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.07.008

zbMATH Keywords

algorithmsfacility locationcomputational geometry

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

REGION INTERVISIBILITY IN TERRAINS ⋮ Guarding a terrain by two watchtowers

Cites Work

• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Computing dominances in \(E^ n\)
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms

This page was built for publication: Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem