Efficiently approximating polygonal paths in three and higher dimensions (0)

by G Barequet, D Z Chen, O Daescu, M T Goodrich, J Snoeyink
Venue:Algorithmica