{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:22Z","timestamp":1760441062994},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_19","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T10:19:29Z","timestamp":1334053169000},"page":"219-230","source":"Crossref","is-referenced-by-count":5,"title":["Two-Dimensional Range Diameter Queries"],"prefix":"10.1007","author":[{"given":"Pooya","family":"Davoodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Freek","family":"van Walderveen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol.\u00a0223, pp. 1\u201356. AMS (1999)","DOI":"10.1090\/conm\/223\/03131"},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. Journal of the ACM\u00a051(4), 606\u2013635 (2004)","journal-title":"Journal of the ACM"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/11682462_12","volume-title":"LATIN 2006: Theoretical Informatics","author":"B. Aronov","year":"2006","unstructured":"Aronov, B., Bose, P., Demaine, E.D., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M.: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 80\u201392. Springer, Heidelberg (2006)"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02187699","volume":"1","author":"D. Avis","year":"1986","unstructured":"Avis, D.: Diameter partitioning. Discrete & Computational Geometry\u00a01(1), 265\u2013276 (1986)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0898-1221(82)90054-2","volume":"8","author":"D. Avis","year":"1982","unstructured":"Avis, D., Toussaint, G.T., Bhattacharya, B.K.: On the multimodality of distances in convex polygons. Computers & Mathematics with Applications\u00a08(2), 153\u2013156 (1982)","journal-title":"Computers & Mathematics with Applications"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jagm.2000.1127","volume":"38","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. Journal of Algorithms\u00a038(1), 91\u2013109 (2001)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0196-6774(91)90007-L","volume":"12","author":"V. Capoyleas","year":"1991","unstructured":"Capoyleas, V., Rote, G., Woeginger, G.J.: Geometric clusterings. Journal of Algorithms\u00a012(2), 341\u2013356 (1991)","journal-title":"Journal of Algorithms"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Larsen, K.G., P\u01cetra\u015fcu, M.: Orthogonal range searching on the RAM, revisited. In: Proc. 27th Symp. on Comp. Geometry, pp. 1\u201310 (2011)","DOI":"10.1145\/1998196.1998198"},{"issue":"40-42","key":"19_CR9","doi-asserted-by":"publisher","first-page":"3795","DOI":"10.1016\/j.tcs.2010.06.002","volume":"411","author":"H. Cohen","year":"2010","unstructured":"Cohen, H., Porat, E.: Fast set intersection and two-patterns matching. Theoretical Computer Science\u00a0411(40-42), 3795\u20133800 (2010)","journal-title":"Theoretical Computer Science"},{"key":"19_CR10","unstructured":"Cohen, H., Porat, E.: On the hardness of distance oracle for sparse graph. The Computing Research Repository (arXiv), abs\/1006.1117 (2010)"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H.: Computing the extreme distances between two convex polygons. Journal of Algorithms\u00a06(2), 213\u2013224 (1985)","journal-title":"Journal of Algorithms"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Lin, K.-I.: FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 163\u2013174 (1995)","DOI":"10.1145\/568271.223812"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th STOC, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1007\/11602613_89","volume-title":"Algorithms and Computation","author":"P. Gupta","year":"2005","unstructured":"Gupta, P.: Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 892\u2013901. Springer, Heidelberg (2005)"},{"key":"19_CR15","unstructured":"Gupta, P., Janardan, R., Kumar, Y., Smid, M.H.M.: Data structures for range-aggregate extent queries. In: Proc. 20th CCCG, pp. 7\u201310 (2008)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: A practical approach for computing the diameter of a point set. In: Proc. 17th Symp. on Comp. Geometry, pp. 177\u2013186. ACM (2001)","DOI":"10.1145\/378583.378662"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/S0097539703427963","volume":"33","author":"S. Har-Peled","year":"2004","unstructured":"Har-Peled, S., Wang, Y.: Shape fitting with outliers. SIAM Journal on Computing\u00a033(2), 269\u2013285 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-45581-7_23","volume-title":"Conceptual Modeling - ER 2001","author":"S. Hong","year":"2001","unstructured":"Hong, S., Song, B., Lee, S.-H.: Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments. In: Kunii, H.S., Jajodia, S., S\u00f8lvberg, A. (eds.) ER 2001. LNCS, vol.\u00a02224, pp. 299\u2013310. Springer, Heidelberg (2001)"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jcss.1998.1577","volume":"57","author":"P.B. Miltersen","year":"1998","unstructured":"Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. Journal of Computer and System Sciences\u00a057(1), 37\u201349 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR20","unstructured":"Nekrich, Y., Smid, M.H.M.: Approximating range-aggregate queries using coresets. In: Proc. 22nd CCCG, pp. 253\u2013256 (2010)"},{"key":"19_CR21","series-title":"Texts and monographs in computer science","volume-title":"Computational geometry: an introduction","author":"F. Preparata","year":"1991","unstructured":"Preparata, F., Shamos, M.: Computational geometry: an introduction. Texts and monographs in computer science, Section 4.2.3. Springer, Heidelberg (1991)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Roditty, L.: Distance oracles beyond the Thorup-Zwick bound. In: Proc. 51st FOCS, pp. 815\u2013823 (2010)","DOI":"10.1109\/FOCS.2010.83"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-19094-0_14","volume-title":"WALCOM: Algorithms and Computation","author":"S. Rahul","year":"2011","unstructured":"Rahul, S., Das, A.S., Rajan, K.S., Srinathan, K.: Range-Aggregate Queries Involving Geometric Aggregation Operations. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol.\u00a06552, pp. 122\u2013133. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:56:29Z","timestamp":1556668589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}