Given an orientable genus-0 polyhedral surface defined by n triangles, and a\ud set of m point sites on it, we would like to identify its 1-center, i.e., the location on the\ud surface that minimizes the maximum distance to the sites. The distance is measured as\ud the length of the Euclidean shortest path along the surface. To compute the 1-center, we\ud compute the furthest-site Voronoi diagram of the sites on the polyhedral surface. We show\ud that the diagram has maximum combinatorial complexity Θ(mn2), and present an algorithm\ud that computes the diagram in O(mn2 logm log n) expected time. The 1-center can then be\ud identified in time linear in the size of the diagram
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.