Answers are grounded in this paper and cite their sources.
In this paper we study the Voronoi diagram for a set of N line segments and circles in the Euclidean plane. The diagram is a generalization of the Voronoi diagram for a set of points in the plane and has applications in wire layout, facility location, clustering and contouring problems. We present an O(N(log N)² ) algorithm for constructing the diagram. It is an improvement of a previous known result which takes O(Nc√log N ) time. The algorithm described in this paper is also shown to be applicable under a more general metric if certain conditions are satisfied.
No takes yet. Share an insight, caveat, or question.
Lee et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: