An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments |
scientific article; zbMATH DE number 4022640
| 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; zbMATH DE number 4022640 |
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
