An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800)
From MaRDI portal
scientific article; zbMATH DE number 5279489
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane |
scientific article; zbMATH DE number 5279489 |
Statements
An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (English)
0 references
27 May 2008
0 references
