On multiplicatively weighted Voronoi diagrams for lines in the plane
Transactions on computational science XIII
| Hi-index | 0.00 |
We describe a method based on the wavefront propagation, which computes a multiplicatively weighted Voronoi diagram for a set $L$ of $n$ lines in the plane in $O(n^2 \log n)$ time and $O(n^2)$ space. In the process, we derive complexity bounds and certain structural properties of such diagrams. An advantage of our approach over the general purpose machinery, which requires computation of the lower envelope of a set of halfplanes in three-dimensional space, lies in its relative simplicity. Besides, we point out that the unweighted Voronoi diagram for $n$ lines in the plane has a simple structure, and can be obtained in optimal $\Theta(n^2)$ time and space.