16 citations · 17 across the 3 of their papers we have counts for
3 papers
cs.CG2018
Altitude Terrain Guarding and Guarding Uni-Monotone Polygons
Ovidiu Daescu, Stephan Friedrichs, Hemant Malik +2
We present an optimal, linear-time algorithm for the following version of terrain guarding: given a 1.5D terrain and a horizontal line, place the minimum number of guards on the li…
cs.CG2015★ 1 cited
Computing the Geodesic Diameter and Center of a Polygonal Domain
Sang Won Bae, Matias Korman, Joseph S. B. Mitchell +3
For a polygonal domain with holes and a total of vertices, we present algorithms that compute the geodesic diameter in time and the geodesic center…
cs.DS2008★ 16 cited
The Minimum Backlog Problem
Michael A. Bender, Sándor P. Fekete, Alexander Kröller +4
We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP. The discrete MBP is a 2-perso…