Loading...
Please wait, while we are loading the content...
Similar Documents
Facility location on terrains (extended abstract) (1998).
| Content Provider | CiteSeerX |
|---|---|
| Author | Varadarajan, Kasturirangan Kreveld, Marc Van Oostrum, René Van Aronov, Boris |
| Abstract | Given a terrain defined as a piecewise-linear function with n triangles, and m point sites on it, we would like to identify the location on the terrain that minimizes the maximum distance to the sites. The distance is measured as the length of the Euclidean shortest path along the terrain. To simplify the problem somewhat, we extend the terrain to (the surface of) a polyhedron. To compute the optimum placement, we compute the furthest-site Voronoi diagram of the sites on the polyhedron. The diagram has maximum combinatorial complexity Θ(mn²), and the algorithm runs in O(mn² log² m(log m +logn)) time. |
| File Format | |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Mn Log Extended Abstract Maximum Distance Optimum Placement Facility Location Combinatorial Complexity Log Logn Piecewise-linear Function Furthest-site Voronoi Diagram |
| Content Type | Text |
