The Furthest-Site Geodesic Voronoi Diagram
A common goal of much recent research in computational geometry is to extend algorithms that have been developed for the Euclidean metric to the more complicated geodesic metric inside a simple polygon.
We have limited content available for some countries. Find office information and country specific information through our country hub.
A common goal of much recent research in computational geometry is to extend algorithms that have been developed for the Euclidean metric to the more complicated geodesic metric inside a simple polygon.