TY  - BOOK
AU  - Akman,Varol
ED  - SpringerLink (Online service)
TI  - Unobstructed Shortest Paths in Polyhedral Environments
T2  - Lecture Notes in Computer Science,
SN  - 9783540477310
AV  - T385 
U1  - 006.6 23
PY  - 1987///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Artificial intelligence
KW  - Computer simulation
KW  - Computer graphics
KW  - Computer Science
KW  - Computer Graphics
KW  - Simulation and Modeling
KW  - Artificial Intelligence (incl. Robotics)
N1  - Solution of the general instance of FINDPATH -- Solutions of two specific instances of FINDPATH -- Two Voronoi-based techniques for FINDPATH -- Desirable functionalities of a geometer's workbench -- Conclusion and future work
UR  - http://dx.doi.org/10.1007/3-540-17629-2
ER  -