An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points |
scientific article |
Statements
An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (English)
0 references
24 March 2010
0 references
computational geometry
0 references
farthest-segment Voronoi diagram
0 references
