Hershberger, John; Suri, Subhash Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^ 3\). (English) Zbl 0849.68118 Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 447-456 (1995). Cited in 1 Document MSC: 68U05 Computer graphics; computational geometry (digital and algorithmic aspects) 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science Keywords:shortest paths; convex polytope PDFBibTeX XMLCite \textit{J. Hershberger} and \textit{S. Suri}, in: Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, SODA '95, San Francisco, CA, USA, January 22--24, 1995. Philadelphia, PA: SIAM; New York, NY: ACM. 447--456 (1995; Zbl 0849.68118)