An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Robert L. Scot Drysdale / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Asish Kumar Mukhopadhyay / rank | |||
Normal rank | |||
Revision as of 16:37, 20 February 2024
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
