An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shortest path amidst disc obstacles is computable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sweepline algorithm for Euclidean Voronoi diagram of circles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Science and Its Applications – ICCSA 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4945516 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles / rank | |||
Normal rank |
Latest revision as of 10:55, 28 June 2024
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
0 references