An <i>O</i> ( <i>n</i> log <i>n</i> ) Algorithm for Rectilinear Minimal Spanning Trees (Q4178506): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322123.322124 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035622528 / rank | |||
Normal rank | |||
Latest revision as of 22:36, 19 March 2024
scientific article; zbMATH DE number 3614196
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i> ( <i>n</i> log <i>n</i> ) Algorithm for Rectilinear Minimal Spanning Trees |
scientific article; zbMATH DE number 3614196 |
Statements
An <i>O</i> ( <i>n</i> log <i>n</i> ) Algorithm for Rectilinear Minimal Spanning Trees (English)
0 references
1979
0 references
Voronoi Diagram
0 references
Algorithm
0 references
Rectilinear Distance
0 references
Minimal Spanning Trees
0 references
