Linear Data Structures for Two Types of Range Search. Chazelle, B. & Edelsbrunner, H. In Symposium on Computational Geometry, pages 293-302, 1986. ACM.
Linear Data Structures for Two Types of Range Search. [link]Link  Linear Data Structures for Two Types of Range Search. [link]Paper  bibtex   
@inproceedings{ conf/compgeom/ChazelleE86,
  added-at = {2015-01-30T00:00:00.000+0100},
  author = {Chazelle, Bernard and Edelsbrunner, Herbert},
  biburl = {http://www.bibsonomy.org/bibtex/23ddabf60381fd5bb1331380f148788a0/dblp},
  booktitle = {Symposium on Computational Geometry},
  crossref = {conf/compgeom/1986},
  editor = {Aggarwal, Alok},
  ee = {http://doi.acm.org/10.1145/10515.10547},
  interhash = {c3a05ba49b79e8088fc6311906d5f6d7},
  intrahash = {3ddabf60381fd5bb1331380f148788a0},
  isbn = {0-89791-194-6},
  keywords = {dblp},
  pages = {293-302},
  publisher = {ACM},
  title = {Linear Data Structures for Two Types of Range Search.},
  url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom86.html#ChazelleE86},
  year = {1986}
}

Downloads: 0