Computing the geodesic center of a simple polygon . Academic Press, 1987. This formulation of the problem tacitly assumes that all points in P are an infinite family of customers, not a very realistic assumption. An edge between two Voronoi vertices is either a straight edge or a hyperbolic arc. Finally , the boundary of a Voronoi cell consists of a concatenation of straight edges and hyperbolic arcs.
P lies on the midpoint of the geodesic diameter, it has a special property.
Finally , the boundary of a Voronoi cell consists of a concatenation of straight edges and hyperbolic arcs. P lies on the midpoint of the geodesic diameter, it has a special property. Discrete Algorithms and Complexity, Proceedings of Japan- US Joint Seminar, D.S. Johnson, A. Nozaki, T. Nishizeki, H. Willis, Eds, Academic Press, Boston, pp. No context found. No context found.