An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370): Difference between revisions

For two-dimensional Euclidean space, an O(n log n) algorithm for computing the Voronoi diagram of a set of points, line segments, and circular arcs is given. The line and circular segments may intersect only at their endpoints. Possible applications of the algorithm are suggested in robotics.