Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle (Q4340963)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1022928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle |
scientific article; zbMATH DE number 1022928 |
Statements
Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle (English)
0 references
27 July 1997
0 references
shortest-path
0 references
minimum-link-path queries
0 references
data structure
0 references
0.8654711246490479
0 references
0.8522890210151672
0 references
0.838821530342102
0 references
0.8253242373466492
0 references
