Unobstructed Shortest Paths in Polyhedral Environments [electronic resource] / by Varol Akman.

By: Akman, Varol [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 251Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1987Description: X, 106 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540477310Subject(s): Computer science | Artificial intelligence | Computer simulation | Computer graphics | Computer Science | Computer Graphics | Simulation and Modeling | Artificial Intelligence (incl. Robotics)Additional physical formats: Printed edition:: No titleDDC classification: 006.6 LOC classification: T385Online resources: Click here to access online
Contents:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK6159

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha