We introduce the first sweep line algorithm for computing spherical Voronoi diagrams, which proves that Fortune's method can be extended to points on a sphere surface. This algorithm is similar to Fortune's plane sweep algorithm, sweeping the sphere with a circular line instead of a straight one.
Like its planar counterpart, the novel linear-space algorithm has worst-case optimal running time. Furthermore, it copes very well with degeneracies and is easy to implement. Experimental results show that the performance of our algorithm is very similar to that of Fortune's algorithm, both with synthetic data sets and with real data.
The usual solutions make use of the connection between convex hulls and spherical Delaunay triangulations. An experimental comparison revealed that our algorithm outperforms the freely available implementations that compute convex hulls of point sets in 3D, enabling it to be the preferred choice for computing Voronoi diagrams on the sphere.
|Title of host publication||ISVD|
|Publication status||Published - 1 Jan 2010|
|Event||International Symposium on Voronoi Diagrams in Science and Engineering (ISVD) - |
Duration: 1 Jan 2010 → …
|Conference||International Symposium on Voronoi Diagrams in Science and Engineering (ISVD)|
|Period||1/01/10 → …|