{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:04:20Z","timestamp":1742918660857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_21","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"283-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles"],"prefix":"10.1007","author":[{"given":"Timothy M.","family":"Chan","sequence":"first","affiliation":[]},{"given":"Yakov","family":"Nekrich","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-87744-8_4","volume-title":"Algorithms - ESA 2008","author":"P Afshani","year":"2008","unstructured":"Afshani, P.: On dominance reporting in 3D. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 41\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_4"},{"key":"21_CR2","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: Proceedings of 41st Annual Symposium on Foundations of Computer Science, (FOCS 2000), pp. 198\u2013207 (2000)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Arge, L., Samoladas, V., Vitter, J.S.: On two-dimensional indexability and optimal range search indexing. In: Proceedings of 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 346\u2013357 (1999)","DOI":"10.1145\/303976.304010"},{"issue":"1\u20132","key":"21_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.comgeo.2007.10.006","volume":"41","author":"B Aronov","year":"2008","unstructured":"Aronov, B., de Berg, M., Gray, C.: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1\u20132), 68\u201376 (2008)","journal-title":"Comput. Geom."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF00263991","volume":"13","author":"JL Bentley","year":"1980","unstructured":"Bentley, J.L., Maurer, H.A.: Efficient worst-case data structures for range searching. Acta Inf. 13, 155\u2013168 (1980)","journal-title":"Acta Inf."},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2483699.2483702","volume":"9","author":"TM Chan","year":"2013","unstructured":"Chan, T.M.: Persistent predecessor search and orthogonal point location on the word RAM. ACM Trans. Algorithms 9(3), 22 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the RAM. In: Proceedings of 27th ACM Symposium on Computational Geometry (SoCG 2011), pp. 1\u201310 (2011)","DOI":"10.1145\/1998196.1998198"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Nekrich, Y., Smid, M.: Orthogonal range reporting and rectangle stabbing for fat rectangles. CoRR, abs\/1905.02322 (2019)","DOI":"10.1007\/978-3-030-24766-9_21"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle, B.: Filtering search: a new approach to query-answering. SIAM J. Comput. 15(3), 703\u2013724 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3), 427\u2013462 (1988)","journal-title":"SIAM J. Comput."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02187875","volume":"2","author":"B Chazelle","year":"1987","unstructured":"Chazelle, B., Edelsbrunner, H.: Linear space data structures for two types of range search. Discrete Comput. Geom. 2, 113\u2013126 (1987)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/060672261","volume":"38","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Gray, C.: Vertical ray shooting and computing depth orders for fat objects. SIAM J. Comput. 38(1), 257\u2013275 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0925-7721(99)00059-0","volume":"15","author":"A Efrat","year":"2000","unstructured":"Efrat, A., Katz, M.J., Nielsen, F., Sharir, M.: Dynamic data structures for fat objects and their applications. Comput. Geom. 15(4), 215\u2013227 (2000)","journal-title":"Comput. Geom."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proceedings of 16th Annual ACM Symposium on Theory of Computing (STOC 1984), pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"21_CR15","unstructured":"Iacono, J., Langerman, S.: Dynamic point location in fat hyperrectangles with integer coordinates. In: Proceedings of 12th Canadian Conference on Computational Geometry (2000)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-02882-3_22","volume-title":"Computing and Combinatorics","author":"M Karpinski","year":"2009","unstructured":"Karpinski, M., Nekrich, Y.: Space efficient multi-dimensional range reporting. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 215\u2013224. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02882-3_22"},{"issue":"6","key":"21_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0925-7721(96)00027-2","volume":"8","author":"MJ Katz","year":"1997","unstructured":"Katz, M.J.: 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects. Comput. Geom. 8(6), 299\u2013316 (1997)","journal-title":"Comput. Geom."},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Kreveld, M.V., L\u00f6ffler, M.: Range Searching, pp. 1\u20137. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","DOI":"10.1007\/978-1-4939-2864-4"},{"key":"21_CR19","unstructured":"Lewenstein, M., Nekrich, Y., Vitter, J.S.: Space-efficient string indexing for wildcard pattern matching. In: Proceedings of 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), pp. 506\u2013517 (2014)"},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","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":"21_CR21","doi-asserted-by":"crossref","unstructured":"Navarro, G., Nekrich, Y.: Top-k document retrieval in optimal time and linear space. In: Proceedings of 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012, pp. 1066\u20131077 (2012)","DOI":"10.1137\/1.9781611973099.84"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Nekrich, Y.: A data structure for multi-dimensional range reporting. In: Proceedings of 23rd ACM Symposium on Computational Geometry (SoCG), pp. 344\u2013353 (2007)","DOI":"10.1145\/1247069.1247130"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00453-007-9030-9","volume":"49","author":"Y Nekrich","year":"2007","unstructured":"Nekrich, Y.: Space efficient dynamic orthogonal range reporting. Algorithmica 49(2), 94\u2013108 (2007)","journal-title":"Algorithmica"},{"key":"21_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27848-8","volume-title":"Encyclopedia of Algorithms","year":"2008","unstructured":"Nekrich, Y.: Orthogonal Range Searching on Discrete Grids, pp. 1\u20136. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-3-642-27848-8"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Rahul, S.: Improved bounds for orthogonal point enclosure query and point location in orthogonal subdivisions in $$\\mathbb{R}^3$$. In: Proceedings of 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 200\u2013211 (2015)","DOI":"10.1137\/1.9781611973730.15"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Vengroff, D.E., Vitter, J.S.: Efficient 3-D range searching in external memory. In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 192\u2013201 (1996)","DOI":"10.1145\/237814.237864"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:54:14Z","timestamp":1710266054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}