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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2007.08.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2007.08.004 / rank | |||
Normal rank | |||
Latest revision as of 07:21, 18 December 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
