%0 Journal Article %1 journals/algorithmica/BarequetCDGS02 %A Barequet, Gill %A Chen, Danny Z. %A Daescu, Ovidiu %A Goodrich, Michael T. %A Snoeyink, Jack %D 2002 %J Algorithmica %K dblp %N 2 %P 150-167 %T Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica33.html#BarequetCDGS02 %V 33

@article{journals/algorithmica/BarequetCDGS02, added-at = {2011-05-18T00:00:00.000+0200}, author = {Barequet, Gill and Chen, Danny Z. and Daescu, Ovidiu and Goodrich, Michael T. and Snoeyink, Jack}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/23ed6d5b045427f0f5f052f7e64de3560/dblp}, ee = {http://dx.doi.org/10.1007/s00453-001-0096-5}, interhash = {5c12e86205b2f9c07a6a840a589ed35f}, intrahash = {3ed6d5b045427f0f5f052f7e64de3560}, journal = {Algorithmica}, keywords = {dblp}, number = 2, pages = {150-167}, timestamp = {2016-02-02T01:12:13.000+0100}, title = {Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica33.html#BarequetCDGS02}, volume = 33, year = 2002 }