{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:27Z","timestamp":1759638267362},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1016\/0020-0190(84)90105-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"99-102","source":"Crossref","is-referenced-by-count":26,"title":["An O(n log n) Manhattan path algorithm"],"prefix":"10.1016","volume":"19","author":[{"suffix":"Jr.","given":"Witold","family":"Lipski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90105-4_BIB1","article-title":"Solutions to Klee's rectangle problems","author":"Bentley","year":"1977","journal-title":"Unpublished notes"},{"key":"10.1016\/0020-0190(84)90105-4_BIB2","unstructured":"H. Edelsbrunner, J. van Leeuven, T. Ottmann and D. Wood, Computing the connected components of simple rectilinear geometric objects in D-space, Computer Sci. Tech. Rept. CS-83-17; RAIRO, to appear."},{"key":"10.1016\/0020-0190(84)90105-4_BIB3","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","article-title":"The complexity of computing the measure of \u222a[ai, bi]","volume":"21","author":"Fredman","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(84)90105-4_BIB4","first-page":"246","article-title":"A linear-time algorithm for a special case of disjoint set union","author":"Gabow","year":"1983","journal-title":"Proc. 15th Annual ACM Symp. on Theory of Computing, Boston, MA"},{"key":"10.1016\/0020-0190(84)90105-4_BIB5","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0020-0190(84)90105-4_BIB6","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\/0020-0190(84)90105-4_BIB7","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:58:22Z","timestamp":1555073902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084901054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0020019084901054"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90105-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}