Finding All Shortest Path Edge Sequences on a Convex Polyhedron

Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu. Finding All Shortest Path Edge Sequences on a Convex Polyhedron. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, Workshop WADS 89, Ottawa, Canada, August 17-19, 1989, Proceedings. Volume 382 of Lecture Notes in Computer Science, pages 251-266, Springer, 1989.

No reviews for this publication, yet.