{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:34:43Z","timestamp":1648748083527},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01190156","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:43:07Z","timestamp":1108680187000},"page":"572-590","source":"Crossref","is-referenced-by-count":7,"title":["Algorithms for projecting points to give the most uniform distribution with applications to hashing"],"prefix":"10.1007","volume":"9","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman: Problem 2.12,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"T. Asano, L. J. Guibas, and T. Tokuyama: Walking on an Arrangement Topologically,Proc. 7th ACM Symposium on Computational Geometry, pp. 297?306, 1991.","DOI":"10.1145\/109648.109690"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley and T. Ottman: Algorithms for Reporting and Counting Geometric Intersections,IEEE Trans. Comput., vol. 28, pp. 643?647, Sept. 1979.","journal-title":"IEEE Trans. Comput."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle, L. J. Guibas, and D. T. Lee: The Power of Geometric Duality,Proc. 24th Symposium on Foundations of Computer Science, pp. 217?225, 1983.","DOI":"10.1109\/SFCS.1983.75"},{"issue":"no. 2","key":"CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/0211017","volume":"11","author":"D. Comer","year":"1982","unstructured":"D. Comer and M. J. O'Donnell: Geometric Problems with Applications to Hashing,SIAM J. Comput., vol. 11, no. 2, pp. 217?26, 1982.","journal-title":"SIAM J. Comput."},{"key":"CR6","volume-title":"EATCS Monographs in Theoretical Computer Science, vol. 10","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner:Algorithms in Combinatorial Geometry, EATCS Monographs in Theoretical Computer Science, vol. 10, Springer-Verlag, Berlin, 1987."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and L. J. Guibas: Topologically Sweeping an Arrangement, Research Report 9, Digital Systems Research Center, 1986.","DOI":"10.1145\/12130.12171"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(86)90088-8","volume":"23","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner and E. Welzl: Half Planar Range Search in Linear Space andO(n 0.695) Query Time,Inform. Process. Lett., vol. 23, pp. 289?193, 1986.","journal-title":"Inform. Process. Lett."},{"key":"CR9","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn:Data Structures and Algorithms, 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1984."},{"key":"CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry?An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos:Computational Geometry?An Introduction, second edition, Springer-Verlag, New York, 1985.","edition":"second edition"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190156.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190156\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:40:34Z","timestamp":1586119234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01190156"],"URL":"https:\/\/doi.org\/10.1007\/bf01190156","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}