BibTeX record journals/algorithmica/BarequetCDGS02

download as .bib file

@article{DBLP:journals/algorithmica/BarequetCDGS02,
  author       = {Gill Barequet and
                  Danny Z. Chen and
                  Ovidiu Daescu and
                  Michael T. Goodrich and
                  Jack Snoeyink},
  title        = {Efficiently Approximating Polygonal Paths in Three and Higher Dimensions},
  journal      = {Algorithmica},
  volume       = {33},
  number       = {2},
  pages        = {150--167},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00453-001-0096-5},
  doi          = {10.1007/S00453-001-0096-5},
  timestamp    = {Wed, 17 May 2017 14:25:11 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BarequetCDGS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.