Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)
SHORTEST PATH MOTION IN
3 DIMENSIONS
Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)
Next: MAXIMUM MAP LABELING
Up: Miscellaneous
Previous: MAXIMUM COMPATIBLE BINARY CONSTRAINT
Index
- INSTANCE:
Two points s,t and several polyhedral obstacles in three-dimensional
Euclidean space.
- SOLUTION:
A path from s to t that avoids the obstacles.
- MEASURE:
The total length of the path in Euclidean metric.
- Good News:
Admits an FPTAS [390] and [111].
Viggo Kann
2000-03-20