Sciweavers

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

110

Voted

COMPGEOM
1998
ACM

97views Discrete Geometry» more COMPGEOM 1998»

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

15 years 6 months ago

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

Download www.ics.uci.edu

Gill Barequet, Michael T. Goodrich

Real-time Traffic

COMPGEOM 1998 | Discrete Geometry |

claim paper

Related Content

» Separation and Approximation of Polyhedral Objects

» Fast computation of generalized Voronoi diagrams using graphics hardware

» Sublinear geometric algorithms

» Maximum thick paths in static and dynamic environments

» Movement Planning in the Presence of Flows

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1998
Where	COMPGEOM
Authors	Gill Barequet, Michael T. Goodrich

Comments (0)