Akman, Varol.
Unobstructed Shortest Paths in Polyhedral Environments [electronic resource] / by Varol Akman. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1987. - X, 106 p. online resource. - Lecture Notes in Computer Science, 251 0302-9743 ; . - Lecture Notes in Computer Science, 251 .
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.
9783540477310
10.1007/3-540-17629-2 doi
Computer science.
Artificial intelligence.
Computer simulation.
Computer graphics.
Computer Science.
Computer Graphics.
Simulation and Modeling.
Artificial Intelligence (incl. Robotics).
T385
006.6
Unobstructed Shortest Paths in Polyhedral Environments [electronic resource] / by Varol Akman. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1987. - X, 106 p. online resource. - Lecture Notes in Computer Science, 251 0302-9743 ; . - Lecture Notes in Computer Science, 251 .
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.
9783540477310
10.1007/3-540-17629-2 doi
Computer science.
Artificial intelligence.
Computer simulation.
Computer graphics.
Computer Science.
Computer Graphics.
Simulation and Modeling.
Artificial Intelligence (incl. Robotics).
T385
006.6