An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions |
scientific article; zbMATH DE number 5566420
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions |
scientific article; zbMATH DE number 5566420 |
Statements
An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (English)
0 references
18 June 2009
0 references
minimum link path
0 references
rectilinear path
0 references
shortest path
0 references
binary space partition
0 references
sweep plane
0 references
segment tree
0 references
priority queue
0 references
algorithms
0 references
