Traversing a set of points with a minimum number of turns. Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., & Valtr, P. In Symposium on Computational Geometry, pages 46-55, 2007. ACM.
Traversing a set of points with a minimum number of turns. [link]Link  Traversing a set of points with a minimum number of turns. [link]Paper  bibtex   
@inproceedings{ conf/compgeom/BeregBDHV07,
  added-at = {2007-06-08T00:00:00.000+0200},
  author = {Bereg, Sergey and Bose, Prosenjit and Dumitrescu, Adrian and Hurtado, Ferran and Valtr, Pavel},
  biburl = {http://www.bibsonomy.org/bibtex/224efd79728e3565edf3b134f1c70d319/dblp},
  booktitle = {Symposium on Computational Geometry},
  crossref = {conf/compgeom/2007},
  editor = {Erickson, Jeff},
  ee = {http://doi.acm.org/10.1145/1247069.1247077},
  interhash = {f8496c0fd84412daa5934979ad8f890b},
  intrahash = {24efd79728e3565edf3b134f1c70d319},
  isbn = {978-1-59593-705-6},
  keywords = {dblp},
  pages = {46-55},
  publisher = {ACM},
  title = {Traversing a set of points with a minimum number of turns.},
  url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom2007.html#BeregBDHV07},
  year = {2007}
}

Downloads: 0