An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (Q1380799)
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 efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane |
scientific article; zbMATH DE number 1127621
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane |
scientific article; zbMATH DE number 1127621 |
Statements
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (English)
0 references
11 March 1998
0 references
shortest path
0 references
0.9507974
0 references
0.94194806
0 references
0.94022655
0 references
0.9400505
0 references
0.93599564
0 references
0.93236446
0 references
0.9313834
0 references
0.9313834
0 references
