Consider the following survival problem:Given a set of k trajectories (paths) with maximum unit speed in a boundedregion over a (long) time interval [0,T], find another trajectory (if itexists)â€¦ (More)

The art gallery problem was originally posed by Victor Klee in 1973 as the question of determining the minimum number of guards sufficient to see every point of the interior of an n-vertex simpleâ€¦ (More)

Given a set L of non-parallel lines in the plane and a nonempty subset Lâ€² âŠ† L, a guarding tree for Lâ€² is a tree contained in the union of the lines in L such that if a mobile guard (agent) runs onâ€¦ (More)

We revisit the problem of pursuit-evasion in a grid introduc ed by Sugihara and Suzuki in the lineof-sight vision model. Consider an arbitrary evader Z with the maximum speed of 1 who moves (in aâ€¦ (More)

The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all points in a Euclidean spaceâ€¦ (More)

A three-dimensional (3D) grid Gntimesntimesn, n ges 2, is the set of points (vertices) with integer coordinates in [0,n-1]times[0,n-1] together with their connecting edges, which is viewed as aâ€¦ (More)