{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:01Z","timestamp":1750306681848,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,10,30]],"date-time":"2014-10-30T00:00:00Z","timestamp":1414627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["GRF 4164\/12 and GRF 4165\/11 from HKRGC"],"award-info":[{"award-number":["GRF 4164\/12 and GRF 4165\/11 from HKRGC"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2014,11,17]]},"abstract":"<jats:p>\n            We consider maintaining a dynamic set\n            <jats:italic>S<\/jats:italic>\n            of\n            <jats:italic>N<\/jats:italic>\n            horizontal segments in \u211d\n            <jats:sup>2<\/jats:sup>\n            such that, given a vertical ray\n            <jats:italic>Q<\/jats:italic>\n            in \u211d\n            <jats:sup>2<\/jats:sup>\n            , the segments in\n            <jats:italic>S<\/jats:italic>\n            intersecting\n            <jats:italic>Q<\/jats:italic>\n            can be reported efficiently. In the external memory model, we give a structure that consumes\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>N<\/jats:italic>\n            \/\n            <jats:italic>B<\/jats:italic>\n            ) space, answers a query in\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:sub>\n              <jats:italic>B<\/jats:italic>\n            <\/jats:sub>\n            <jats:italic>N<\/jats:italic>\n            +\n            <jats:italic>K<\/jats:italic>\n            \/\n            <jats:italic>B<\/jats:italic>\n            ) time (where\n            <jats:italic>K<\/jats:italic>\n            is the number of reported segments), and can be updated in\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:sub>\n              <jats:italic>B<\/jats:italic>\n            <\/jats:sub>\n            <jats:italic>N<\/jats:italic>\n            ) amortized time per insertion and deletion. With\n            <jats:italic>B<\/jats:italic>\n            set to a constant, the structure also works in internal memory, consuming space\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>N<\/jats:italic>\n            ), answering a query in\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:italic>N<\/jats:italic>\n            +\n            <jats:italic>K<\/jats:italic>\n            ) time, and supporting an update in\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:italic>N<\/jats:italic>\n            ) amortized time.\n          <\/jats:p>","DOI":"10.1145\/2559153","type":"journal-article","created":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T16:40:56Z","timestamp":1414860056000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Ray Stabbing"],"prefix":"10.1145","volume":"11","author":[{"given":"Yufei","family":"Tao","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,30]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1559795.1559816"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1145\/48529.48535"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1145\/303976.304010"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1137\/S009753970240481X"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1007\/s007780050028"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.5555\/645338.650387"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08)","author":"Blelloch Guy E.","year":"2008","unstructured":"Guy E. Blelloch . 2008 . Space-efficient dynamic orthogonal point location, segment intersection, and range reporting . In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08) . 894--903. Guy E. Blelloch. 2008. Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08). 894--903."},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1137\/0215051"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1016\/0020-0190(90)90151-M"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of Very Large Data Bases (VLDB'05)","author":"Enderle Jost","year":"2005","unstructured":"Jost Enderle , Nicole Schneider , and Thomas Seidl . 2005 . Efficiently processing queries on interval-and-value tuples in relational databases . In Proceedings of Very Large Data Bases (VLDB'05) . 385--396. Jost Enderle, Nicole Schneider, and Thomas Seidl. 2005. Efficiently processing queries on interval-and-value tuples in relational databases. In Proceedings of Very Large Data Bases (VLDB'05). 385--396."},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_1","DOI":"10.1109\/SFCS.1993.366816"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1145\/780542.780635"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03)","author":"Mortensen Christian Worm","year":"2003","unstructured":"Christian Worm Mortensen . 2003 . Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time . In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03) . 618--627. Christian Worm Mortensen. 2003. Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03). 618--627."},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1145\/319806.319816"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2559153","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2559153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:12Z","timestamp":1750230072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2559153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,30]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,11,17]]}},"alternative-id":["10.1145\/2559153"],"URL":"https:\/\/doi.org\/10.1145\/2559153","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2014,10,30]]},"assertion":[{"value":"2012-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}