An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q676576 |
||
| Property / author | |||
| Property / author: Chee-Keng Yap / rank | |||
Revision as of 16:27, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments |
scientific article |
Statements
An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (English)
0 references
1987
0 references
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.
0 references
computational geometry
0 references
Voronoi diagram
0 references
