%0 Conference Paper %1 conf/compgeom/BarequetG98 %A Barequet, Gill %A Goodrich, Michael T. %A Chen, Danny Z. %A Daescu, Ovidiu %A Snoeyink, Jack %B SCG %D 1998 %E Janardan, Ravi %I ACM %K dblp %P 317-326 %T Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. %U http://dblp.uni-trier.de/db/conf/compgeom/compgeom98.html#BarequetG98 %@ 0-89791-973-4

@inproceedings{conf/compgeom/BarequetG98, added-at = {2021-06-14T00:00:00.000+0200}, author = {Barequet, Gill and Goodrich, Michael T. and Chen, Danny Z. and Daescu, Ovidiu and Snoeyink, Jack}, biburl = {https://www.bibsonomy.org/bibtex/25e421910cb271cc2a43a365d81987c9f/dblp}, booktitle = {SCG}, crossref = {conf/compgeom/1998}, editor = {Janardan, Ravi}, ee = {https://doi.org/10.1145/276884.276920}, interhash = {5ce02ba2e1dae72fa6a59813ffb549a8}, intrahash = {5e421910cb271cc2a43a365d81987c9f}, isbn = {0-89791-973-4}, keywords = {dblp}, pages = {317-326}, publisher = {ACM}, timestamp = {2024-04-09T14:32:54.000+0200}, title = {Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.}, url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom98.html#BarequetG98}, year = 1998 }