{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:37:16Z","timestamp":1742985436334,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648246"},{"type":"electronic","value":"9783540685357"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/3-540-68535-9_7","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:31:22Z","timestamp":1193473882000},"page":"35-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries"],"prefix":"10.1007","author":[{"given":"T.","family":"Graf","sequence":"first","affiliation":[]},{"given":"V.","family":"Kamakoti","sequence":"additional","affiliation":[]},{"given":"N. S.","family":"Janaki Latha","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,4]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0020-0190(92)90133-G","volume":"42","author":"A. Aggarwal","year":"1992","unstructured":"A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari. Optimal time bounds for some proximity problems in the plane. Inform. Process. Lett., 42(1):55\u201360, 1992.","journal-title":"Inform. Process. Lett."},{"key":"7_CR2","unstructured":"A. Brinkmann, T. Graf, and K. Hinrichs. The colored quadrant priority search tree with an application to the all-nearest-foreign-neighbors problem. In Proc. 6th Canad. Conf. Comput. Geom., pages 69\u201374, 1994."},{"key":"7_CR3","first-page":"121","volume-title":"Groundwater in the Urban Environment: Problems, Processes and Management","author":"U. Doering","year":"1997","unstructured":"U. Doering, O. Neuendorf, R. Seidemann, U. Jaekel, and H. Vereecken. Transport of reactive solutes in a heterogeneous aquifer: Simulations with a stochastic approach. In Groundwater in the Urban Environment: Problems, Processes and Management, Chilton et al. (eds). Balkema, Rotterdam, pages 121\u2013126, 1997."},{"key":"7_CR4","first-page":"327","volume":"1","author":"M.F. Goodchild","year":"1987","unstructured":"M.F. Goodchild. A spatial analytic perspective on geographical information systems. Intern. Journ. Geograph. Inform. Syst., 1:327\u2013334, 1987.","journal-title":"Intern. Journ. Geograph. Inform. Syst."},{"key":"7_CR5","unstructured":"T. Graf, U. Hashagen, and H. Vereecken. 3d massive-parallel computation of solute transport in heterogeneous porous media. In Fourth SIAM Conference on Mathematical and Computational Issues in the Geosciences, 1997."},{"key":"7_CR6","unstructured":"T. Graf and K. Hinrichs. Distribution algorithms for the all-nearest-foreignneighbors problem in arbitrary L\nt-metrics. In Proc. 6th Canad. Conf. Comput. Geom., pages 69\u201374, 1994."},{"key":"7_CR7","unstructured":"T. Graf and K. Hinrichs. Simple search for the nearest foreign neighbors in arbitrary L\nt-metrics. In Proceedings of the 10th European Workshop on Computational Geometry, pages 25\u201328, 1994."},{"key":"7_CR8","unstructured":"T. Graf, N.S. Janaki Latha, V. Kamakoti, and C. Pandu Rangan. An optimal algorithm for the all-nearest-foreign neighbors problem in arbitrary dimensions (submitted). 1996."},{"key":"7_CR9","unstructured":"T. Graf, V. Kamakoti, N.S. Janaki Latha, and C. Pandu Rangan. Efficient randomized algorithms for the on-line closest-foreign-pair problem (submitted). 1996."},{"key":"7_CR10","first-page":"28","volume":"2","author":"V. Kamakoti","year":"1995","unstructured":"V. Kamakoti, K. Krithivasan, and C. Pandu Rangan. Efficient randomized algorithms for the closest pair problem on colored point sets. Nordic Journal of Computing, 2:28\u201340, 1995.","journal-title":"Nordic Journal of Computing"},{"key":"7_CR11","unstructured":"I. Masser and Blakemore M., editors. Handling geographical information: methodology and potential applications. Long Scientific & Technical, 1991."},{"key":"7_CR12","volume-title":"Data structures and algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Data structures and algorithms, Vol.1\u20133. Springer, New York, 1984."},{"key":"7_CR13","doi-asserted-by":"publisher","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 Shamos M.I. Computational geometry: An introduction. Springer, New York, 1985."},{"key":"7_CR14","unstructured":"Jonathan F. Raper, editor. Three dimensional applications in Geographic Information Systems. Springer-Verlag, 1989."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68535-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T09:58:21Z","timestamp":1589882301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68535-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648246","9783540685357"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-68535-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"4 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}