{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:10Z","timestamp":1725558370159},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_40","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:23:52Z","timestamp":1277241832000},"page":"462-473","source":"Crossref","is-referenced-by-count":3,"title":["Significant-Presence Range Queries in Categorical Data"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Herman J.","family":"Haverkort","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","first-page":"575","volume-title":"CRC Handbook of Computational Geometry","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K.: Range Searching. In: Goodman, J., O\u2019Rourke, J. (eds.) CRC Handbook of Computational Geometry, pp. 575\u2013598. CRC Press, Boca Raton (1997)"},{"key":"40_CR2","series-title":"Contemporary Mathematics","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol.\u00a0223, pp. 1\u201356. American Mathematical Society, Providence (1998)"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45749-6_6","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range searching in categorical data: colored range searching on a grid. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 17\u201328. Springer, Heidelberg (2002)"},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0195-6698(85)80028-7","volume":"6","author":"N. Alon","year":"1985","unstructured":"Alon, N., F\u00fcredi, Z., Katchalski, M.: Separating pairs of points by standard boxes. European J. Combinatorics\u00a06, 205\u2013210 (1985)","journal-title":"European J. Combinatorics"},{"issue":"30","key":"40_CR5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T.K. Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds for planar k-sets and related problems. Discrete and Computational Geometry\u00a019(30), 373\u2013382 (1998)","journal-title":"Discrete and Computational Geometry"},{"key":"40_CR6","unstructured":"van Kreveld, M.: New Results on Data Structures in Computational Geometry. PhD thesis, Utrecht University (1992)"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/B978-044482537-7\/50018-8","volume-title":"Handbook of Computational Geometry","author":"J. Nievergelt","year":"2000","unstructured":"Nievergelt, J., Widmayer, P.: Spatial data structures: concepts and design choices. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 725\u2013764. Elsevier Science Publishers, Amsterdam (2000)"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-57155-8_262","volume-title":"Algorithms and Data Structures","author":"J. Gupta","year":"1993","unstructured":"Gupta, J., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol.\u00a0709, pp. 361\u2013373. Springer, Heidelberg (1993)"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"Janardan, R., Lopez, M.: Generalized intersection searching problems. Internat. J. Comput. Geom. Appl.\u00a03, 39\u201370 (1993)","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"2","key":"40_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00454-001-0005-3","volume":"26","author":"M. Sharir","year":"2001","unstructured":"Sharir, M., Smorodinsky, S., Tardos, G.: An Improved Bound for k-Sets in Three Dimensions. Discrete and Computational Geometry\u00a026(2), 195\u2013204 (2001)","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:49:27Z","timestamp":1552610967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}