{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:42:40Z","timestamp":1757626960120,"version":"3.44.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["59550239"],"award-info":[{"award-number":["59550239"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1016\/0196-6774(87)90024-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"title":["Dynamic orthogonal segment intersection search"],"prefix":"10.1016","volume":"8","author":[{"given":"Hiroshi","family":"Imai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(87)90024-1_BIB1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable searching problems","volume":"8","author":"Bentley","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(87)90024-1_BIB2_1","series-title":"Proceedings, 24th Annual IEEE Symposium on Foundations of Computer Science","first-page":"122","article-title":"Filtering search: A new approach to query-answering","author":"Chazelle","year":"1983"},{"issue":"3","key":"10.1016\/0196-6774(87)90024-1_BIB2_2","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"article-title":"Dynamic Data Structures for Orthogonal Intersection Queries","year":"1980","author":"Edelsbrunner","key":"10.1016\/0196-6774(87)90024-1_BIB3"},{"key":"10.1016\/0196-6774(87)90024-1_BIB4_1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union, July 1982","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(87)90024-1_BIB4_2","series-title":"Proceedings, 15th Annual ACM Symposium on Theory of Computing","first-page":"246","author":"Gabow","year":"1983"},{"issue":"1","key":"10.1016\/0196-6774(87)90024-1_BIB5","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0202024","article-title":"Set merging algorithms","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"article-title":"Efficient Algorithms for Geometric Graph Search Problems","year":"1983","author":"Imai","key":"10.1016\/0196-6774(87)90024-1_BIB6_1"},{"issue":"2","key":"10.1016\/0196-6774(87)90024-1_BIB6_2","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0215033","volume":"15","author":"Imai","year":"1986","journal-title":"SIAM J. Comput."},{"year":"1984","series-title":"An O(n log n) Greedy Heuristic for the Minimum Chord-Length Rectangular Partition","author":"Imai","key":"10.1016\/0196-6774(87)90024-1_BIB7"},{"key":"10.1016\/0196-6774(87)90024-1_BIB8","series-title":"Proceedings, 20th Allerton Conference on Communication, Control and Computing","first-page":"53","article-title":"Minimum edge length partitioning of rectilinear polygons","author":"Lingas","year":"1982"},{"key":"10.1016\/0196-6774(87)90024-1_BIB9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/net.3230130308","article-title":"Finding a Manhattan path and related problems","volume":"13","author":"Lipski","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0196-6774(87)90024-1_BIB10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(84)90105-4","article-title":"An O(n log n) Manhattan path algorithm","volume":"19","author":"Lipski","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(87)90024-1_BIB11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0196-6774(81)90023-7","article-title":"A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems","volume":"2","author":"Lipski","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(87)90024-1_BIB12","series-title":"Proceedings, 19th Annual IEEE Symposium on Foundations of Computer Science","first-page":"28","article-title":"A data structure for orthogonal range queries","author":"Lueker","year":"1978"},{"year":"1982","series-title":"Priority Search Trees","author":"McCreight","key":"10.1016\/0196-6774(87)90024-1_BIB13_1"},{"key":"10.1016\/0196-6774(87)90024-1_BIB13_2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(87)90024-1_BIB14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary search trees of bounded balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(87)90024-1_BIB15","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(81)90093-4","article-title":"Worst-case optimal insertion and deletion methods for decomposable searching problems","volume":"12","author":"Overmars","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(87)90024-1_BIB16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0196-6774(84)90027-0","article-title":"An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems","volume":"5","author":"Soisalon-Soininen","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(87)90024-1_BIB17","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0196-6774(82)90016-5","article-title":"Rectilinear line segment intersection, layered segment trees, and dynamization","volume":"3","author":"Vaishnavi","year":"1982","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/0196-6774(87)90024-1_BIB18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","article-title":"New data structures for orthogonal range queries","volume":"14","author":"Willard","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900241?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900241?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:13:37Z","timestamp":1757463217000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677487900241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["0196677487900241"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(87)90024-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1987,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dynamic orthogonal segment intersection search","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0196-6774(87)90024-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1987 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}