An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles (Q3471860)
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 4139494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles |
scientific article; zbMATH DE number 4139494 |
Statements
An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles (English)
0 references
1989
0 references
shortest path
0 references
three-dimensional space
0 references
polyhedral obstacles
0 references
0.8719630837440491
0 references
0.819354772567749
0 references
0.8154174089431763
0 references
0.8079632520675659
0 references
