{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:35:23Z","timestamp":1757615723839,"version":"3.44.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0020-0190(96)00020-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:27:49Z","timestamp":1027585669000},"page":"313-319","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Rectilinear short path queries among rectangular obstacles"],"prefix":"10.1016","volume":"57","author":[{"given":"Danny A.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin S.","family":"Klenk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00020-8_BIB1","first-page":"79","article-title":"Parallel rectilinear shortest paths with rectangular obstacles","volume":"Vol. 1","author":"Atallah","year":"1991"},{"key":"10.1016\/0020-0190(96)00020-8_BIB2","first-page":"307","article-title":"On parallel rectilinear obstacle-avoiding paths","volume":"Vol. 3","author":"Atallah","year":"1993"},{"article-title":"Finding level-ancestors in trees","year":"1991","author":"Berkman","key":"10.1016\/0020-0190(96)00020-8_BIB3"},{"key":"10.1016\/0020-0190(96)00020-8_BIB4","series-title":"Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"292","article-title":"On the all-pairs Euclidean short path problem","author":"Chen","year":"1995"},{"key":"10.1016\/0020-0190(96)00020-8_BIB5","series-title":"Proc. 11h Ann. Symp. on Computational Geometry","first-page":"370","article-title":"Shortest path queries among weighted obstacles in the rectilinear plane","author":"Chen","year":"1995"},{"key":"10.1016\/0020-0190(96)00020-8_BIB6","series-title":"Proc. 11th Ann. Symp. on Computational Geometry","first-page":"380","article-title":"Rectilinear geodesics in 3-space","author":"Choi","year":"1995"},{"key":"10.1016\/0020-0190(96)00020-8_BIB7","series-title":"Proc. 19th Ann. Symp. on the Theory of Computing","first-page":"56","article-title":"Approximation algorithms for shortest path motion planning","author":"Clarkson","year":"1987"},{"key":"10.1016\/0020-0190(96)00020-8_BIB8","unstructured":"K.L. Clarkson, S. Kapoor and P.M. Vaidya, Rectilinear shortest paths through polygonal obstacles in O(n log32 n) time."},{"key":"10.1016\/0020-0190(96)00020-8_BIB9","series-title":"Proc. 3rd Ann. Symp. on Computational Geometry","first-page":"251","article-title":"Rectilinear shortest paths through polygonal obstacles in O(n(log n)2) time","author":"Clarkson","year":"1987"},{"key":"10.1016\/0020-0190(96)00020-8_BIB10","series-title":"Proc. 7th Ann. Symp. on Computational Geometry","first-page":"51","article-title":"Shortest path queries in rectangular worlds of higher dimension","author":"de Berg","year":"1991"},{"key":"10.1016\/0020-0190(96)00020-8_BIB11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187714","article-title":"Rectilinear shortest paths in the presence of rectangular barriers","volume":"4","author":"de Rezende","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(96)00020-8_BIB12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","article-title":"Optimal point location in a monotone subdivision","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00020-8_BIB13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0218195994000021","article-title":"Orthogonal shortest route queries among axes parallel rectangular obstacles","volume":"4","author":"ElGindy","year":"1994","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0020-0190(96)00020-8_BIB14","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00020-8_BIB15","series-title":"Proc. SIGAL Workshop","article-title":"Shortest path algorithm in the plane with rectilinear polygonal obstacles","author":"Iwai","year":"1994"},{"key":"10.1016\/0020-0190(96)00020-8_BIB16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00020-8_BIB17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/net.3230110307","article-title":"Finding minimum rectilinear distance paths in the presence of barriers","volume":"11","author":"Larson","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0020-0190(96)00020-8_BIB18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1142\/S0218195991000104","article-title":"Shortest rectilinear paths among weighted obstacles","volume":"1","author":"Lee","year":"1991","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0020-0190(96)00020-8_BIB19","series-title":"Proc. 18th Ann. Symp. on the Foundations of Computer Science","first-page":"162","article-title":"Applications of a planar separator theorem","author":"Lipton","year":"1977"},{"key":"10.1016\/0020-0190(96)00020-8_BIB20","series-title":"Proc. Conf. on Theoretical Computer Science","first-page":"1","article-title":"A separator theorem for planar graphs","author":"Lipton","year":"1977"},{"key":"10.1016\/0020-0190(96)00020-8_BIB21","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00020-8_BIB22","series-title":"Presented at the 1st Canadian Conf. on Computational Geometry","article-title":"An optimal algorithm for shortest rectilinear paths among obstacles","author":"Mitchell","year":"1989"},{"key":"10.1016\/0020-0190(96)00020-8_BIB23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01758836","article-title":"L1 shortest paths among polygonal obstacles in the plane","volume":"8","author":"Mitchell","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(96)00020-8_BIB24","series-title":"Proc. 3rd Workshop Algorithms and Data Structures","first-page":"518","article-title":"Efficient approximate shortest-path queries among isothetic rectangular obstacles","volume":"709","author":"Mitra","year":"1993"},{"key":"10.1016\/0020-0190(96)00020-8_BIB25","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: Simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00020-8_BIB26","first-page":"321","article-title":"Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles","author":"Wu","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(96)00020-8_BIB27","first-page":"456","article-title":"Shortest rectilinear paths among weighted rectangles","volume":"13","author":"Yang","year":"1990","journal-title":"J. Inform. Process."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000208?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:27Z","timestamp":1757084307000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0020019096000208"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00020-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1996,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rectilinear short path queries among rectangular obstacles","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(96)00020-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}