Searching for "Efficiently Approximating Polygonal Paths in Three and Higher Dimensions." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Efficiently approximating polygonal paths in three and higher dimensions
by G. Barequet, D. Z. Chen, O. Daescu, M. T. Goodrich, J. Snoeyink — 1998 — Algorithmica
…-Verlag New York Inc. Efficiently Approximating Polygonal Paths in Three and Higher Dimensions 1 G. Barequet…
Cited by 16 (2 self) – Add To MetaCart

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
by Gill Barequet Danny, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink — 1998
…Efficiently Approximating Polygonal Paths in Three and Higher Dimensions Gill Barequet y Danny…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB