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 the normal view instead:
scientific article; zbMATH DE number 4022640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8528403043746948
0 references
0.8432790040969849
0 references
0.8430454730987549
0 references
