An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039)
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 5686471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points |
scientific article; zbMATH DE number 5686471 |
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
0.933539628982544
0 references
0.8194764256477356
0 references
0.8138161301612854
0 references
0.8027358651161194
0 references
