An \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures (Q2081620)
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 \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures |
scientific article; zbMATH DE number 7600778
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures |
scientific article; zbMATH DE number 7600778 |
Statements
An \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures (English)
0 references
13 October 2022
0 references
computational geometry
0 references
computational complexity
0 references
weighted shortest path
0 references
lower bound
0 references
