Optimal location of transportation devices

We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which the travel speed is high. More specifically, one can travel from one endpoint of the walkway to the other at speed v>1, but can only travel at unit speed between any other pair of points. The travel time between any two points in the plane is the minimum between the actual geometric distance, and the time needed to go from one point to the other using the walkway. A location for a walkway is said to be optimal with respect to a given finite set of points if it minimizes the maximum travel time between any two points of the set. We give a simple linear-time algorithm for finding an optimal location in the case where the points are on a line. We also give an @W(nlogn) lower bound for the problem of computing the travel time diameter of a set of n points on a line with respect to a given walkway. Then we describe an O(nlogn) algorithm for locating a walkway with the additional restriction that the walkway must be horizontal. This algorithm is based on a recent generic method for solving quasiconvex programs with implicitly defined constraints. It is used in a (1+@e)-approximation algorithm for optimal location of a walkway of arbitrary orientation.

[1]  Micha Sharir,et al.  Planar geometric location problems and maintaining the width of a planar set , 1991, SODA '91.

[2]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[3]  Alexander Wolff,et al.  Constructing the city Voronoi diagram faster , 2005, EuroCG.

[4]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[5]  Godfried T. Toussaint,et al.  Computational geometry and facility location , 1990 .

[6]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[7]  David Eppstein,et al.  Faster construction of planar two-centers , 1997, SODA '97.

[8]  Pat Morin,et al.  An optimal randomized algorithm for d-variate zonoid depth , 2008, Comput. Geom..

[9]  Timothy M. Chan.  An optimal randomized algorithm for maximum Tukey depth , 2004, SODA '04.

[10]  Rolf Klein,et al.  Voronoi Diagram for services neighboring a highway , 2003, Inf. Process. Lett..

[11]  Robert E. Tarjan,et al.  Planar Point Location Using Persistent Search Trees a , 1989 .

[12]  Matias Korman,et al.  Optimal highway location problem (コンピュテーション) , 2007 .

[13]  L. Vandenberghe,et al.  Quasiconvex Optimization and Location Theory , 1998 .

[14]  Franz Aurenhammer,et al.  Quickest Paths, Straight Skeletons, and the City Voronoi Diagram , 2002, SCG '02.

[15]  David Eppstein,et al.  Quasiconvex Programming , 2004, ArXiv.

[16]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[17]  S. Langerman,et al.  Min-max-min Geometric Facility Location Problems , 2006 .

[18]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[19]  David Eppstein,et al.  Optimal point placement for mesh smoothing , 1997, SODA '97.

[20]  Manuel Abellanas,et al.  The Heavy Luggage Metric , 2008, Int. J. Comput. Geom. Appl..

[21]  Timothy M. Chan.  Geometric Applications of a Randomized Optimization Technique , 1998, SCG '98.

[22]  Sariel Har-Peled,et al.  A practical approach for computing the diameter of a point set , 2001, SCG '01.

[23]  Alexander Wolff,et al.  Constructing Optimal Highways , 2007, CATS.

[24]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.