Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

117

COMPGEOM
1996
ACM

117views Discrete Geometry» more COMPGEOM 1996»

Approximating Shortest Paths on a Convex Polytope in Three Dimensions

15 years 7 months ago

Approximating Shortest Paths on a Convex Polytope in Three Dimensions

Download www.cs.ubc.ca

Sariel Har-Peled, Micha Sharir, Kasturi R. Varadar

Real-time Traffic

COMPGEOM 1996 | Discrete Geometry |

claim paper

Related Content

» Constructing Approximate Shortest Path Maps in Three Dimensions

» An optimaltime algorithm for shortest paths on a convex polytope in three dimensions

» Sublinear geometric algorithms

» Computing approximate shortest paths on convex polytopes

» Metric Combinatorics of Convex Polyhedra Cut Loci and Nonoverlapping Unfoldings

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1996
Where	COMPGEOM
Authors	Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan

Comments (0)