{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:55:35Z","timestamp":1649004935752},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T00:00:00Z","timestamp":1286236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10852-010-9144-y","type":"journal-article","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T09:10:17Z","timestamp":1286183417000},"page":"79-107","source":"Crossref","is-referenced-by-count":1,"title":["Data Structures for Extension Violations in a Query Range"],"prefix":"10.1007","volume":"10","author":[{"given":"Ananda Swarup","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Srinathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,5]]},"reference":[{"key":"9144_CR1","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01182771","volume":"11","author":"B Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica 11, 116\u2013132 (1994)","journal-title":"Algorithmica"},{"key":"9144_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 23, pp. 1\u201356. American Mathematical Society Press (1999)","DOI":"10.1090\/conm\/223\/03131"},{"key":"9144_CR3","unstructured":"Janardan, R., Gupta, P., Kumar, Y., Smid, M.H.: Data structures for range aggregate extent queries. In: Proceedings 20th Canadian Conference on Computational Geometry, pp. 7\u201310 (2008)"},{"key":"9144_CR4","doi-asserted-by":"crossref","unstructured":"Gupta, P.: Algorithms for range-aggregate query problems involving geometric aggregation operations. In: Proceedings, International Symposium on Algorithms and Computation. LNCS, vol. 3827, pp. 892\u2013901. Springer, Verlag (2005)","DOI":"10.1007\/11602613_89"},{"key":"9144_CR5","unstructured":"Szymanski, T.G., van Wyk, C.J.: Layout analysis and verification. In: Preas, B., Lorenzetti, M. (eds.) Physical Design Automation of VLSI Systems, pp.\u00a0347\u2013407. Benjamin, Cummins (1988)"},{"key":"9144_CR6","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Verlag (2000)","DOI":"10.1007\/978-3-662-04245-8"},{"issue":"2","key":"9144_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"EM McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"key":"9144_CR8","unstructured":"Das, A.S., Gupta, P., Srinathan, K.: Data structures for reporting extension violations in a query range. In: Proceedings, 21st Canadian Conference on Computational Geometry (CCCG), pp. 129\u2013132 (2009)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9144-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-010-9144-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9144-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T02:02:58Z","timestamp":1559700178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-010-9144-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,5]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9144"],"URL":"https:\/\/doi.org\/10.1007\/s10852-010-9144-y","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,5]]}}}