A near-optimal algorithm for shortest paths among curved obstacles in the plane (Q5097508)
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: A near-optimal algorithm for shortest paths among curved obstacles in the plane |
scientific article; zbMATH DE number 7575637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A near-optimal algorithm for shortest paths among curved obstacles in the plane |
scientific article; zbMATH DE number 7575637 |
Statements
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (English)
0 references
25 August 2022
0 references
shortest paths
0 references
geometric obstacles
0 references
shortest path map
0 references
obstacle avoidance
0 references
planar subdivision
0 references
0 references
0 references
0 references
0.9852246642112732
0 references
0.8621828556060791
0 references
0.8488910794258118
0 references
0.8487026691436768
0 references
