Unobstructed shortest paths in polyhedral environments. With a foreword by Wm. Randolph Franklin

Additional Metadata
MSC	Computer graphics; computational geometry (msc 68U05), Analysis of algorithms and problem complexity (msc 68Q25), Problem solving (heuristics, search strategies, etc.) (msc 68T20), Network models, deterministic (msc 90B10)
Publisher	Springer-Verlag (Berlin)
Series	Lecture Notes in Computer Science
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Akman, V. (1987). Unobstructed shortest paths in polyhedral environments. With a foreword by Wm. Randolph Franklin. Lecture Notes in Computer Science. Springer-Verlag (Berlin).

Publication