{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:10Z","timestamp":1725663370270},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540529217"},{"type":"electronic","value":"9783540471776"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52921-7_79","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:49:20Z","timestamp":1330206560000},"page":"300-309","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for projecting points to give the most uniform distribution with applications to hashing"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Te. Asano, L.J. Guibas and T. Tokuyama: Walking on an Arrangement Topologically, manuscript, 1990.","DOI":"10.1145\/109648.109690"},{"key":"31_CR2","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. C-28, pp. 643\u2013647, Sept. 1979.","journal-title":"IEEE Trans. Comput."},{"key":"31_CR3","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\u2013225, 1983.","DOI":"10.1109\/SFCS.1983.75"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle: Polytope Range Searching and Integral Geometry, Proc. 28th Symposium on Foundations of Computer Science, pp. 1\u201310, 1987.","DOI":"10.1109\/SFCS.1987.48"},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","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\u201326, 1982.","journal-title":"SIAM J. Comput."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner: Algorithms in Combinatorial Geometry, EATCS Monographs in Theoretical Computer Science, vol. 10, Springer-Verlag Berlin Heidelberg, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and L. J. Guibas: Topologically Sweeping an Arrangement, Digital Systems Research Center, Research Report 9, 1986.","DOI":"10.1145\/12130.12171"},{"key":"31_CR8","doi-asserted-by":"publisher","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 and O(n\n0.695) Query Time, Inform. Process. Lett. vol. 23, pp. 289\u2013193, 1986.","journal-title":"Inform. Process. Lett."},{"key":"31_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry \u2014 An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos: Computational Geometry \u2014 An Introduction, Springer Verlag, New York, 1985."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"E. Welzl: Partition Trees for Triangle Counting and Other Range Searching Problems, Proc. 4th Annual Symposium on Computational Geometry, pp. 23\u201333, Urbana-Champain, IL, June 1988.","DOI":"10.1145\/73393.73397"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0211012","volume":"11","author":"D. Willard","year":"1982","unstructured":"D. Willard: Polygon Retrieval, SIAM J. Comput., vol. 11, pp. 149\u2013165, 1982.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52921-7_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:48:41Z","timestamp":1558270121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52921-7_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540529217","9783540471776"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-52921-7_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}