IEEE - Institute of Electrical and Electronics Engineers, Inc. - Approximating shortest paths on a nonconvex polyhedron

Proceedings 38th Annual Symposium on Foundations of Computer Science

Author(s): Varadarajan, K.R. ; Agarwal, P.K.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1997
Conference Location: Miami Beach, FL, USA, USA
Conference Date: 20 October 1997
Page(s): 182 - 191
ISBN (Paper): 0-8186-8197-7
ISSN (Paper): 0272-5428
DOI: 10.1109/SFCS.1997.646107
Regular:

We present an approximation algorithm that, given the boundary P of a simple, nonconvex polyhedron in R/sup 3/, and two points s and t on P, constructs a path on P between s and t whose length is... View More

Advertisement