We show that the wavefront approach to Voronoi diagrams (a deterministic line-sweep algorithm that does not use geometric transform) can be generalized to distance measures more general than the Euclidean metric. In fact, we provide the first worst-case optimal (O(n log n) time, O(n) space) algorithm that is valid for the full class of what has been called nice metrics in the plane. This also solves the previously open problem of providing an O(n log n)-time plane-sweep algorithm for arbitrary L k-metrics. Nice metrics include all convex distance functions but also distance measures like the Moscow metric, and composed metrics. The algorithm is conceptually simple, but it copes with all possible deformations of the diagram.

Additional Metadata
Keywords Computational geometry, Delaunay triangulation, Sweepline, Voronoi diagram
Journal Algorithmica
Citation
Dehne, F, & Klein, R. (1997). "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. Algorithmica, 17(1), 19–32.