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
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Farthest line segment Voronoi diagrams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 2-point site Voronoi diagrams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4361347 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proximity problems on line segments spanned by points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalization of Voronoi Diagrams in the Plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the all-farthest-segments problem for a planar set of points / rank | |||
Normal rank | |||
Revision as of 14:25, 2 July 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
