{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:53:46Z","timestamp":1787385226402,"version":"build-2736575974"},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0925-7721(93)90004-p","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"307-313","source":"Crossref","is-referenced-by-count":13,"title":["On parallel rectilinear obstacle- avoiding paths"],"prefix":"10.1016","volume":"3","author":[{"given":"Mikhail J.","family":"Atallah","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90004-P_BIB1","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/SFCS.1988.21966","article-title":"Notes on searching in multidimensional monotone arrays","author":"Aggarwal","year":"1988","journal-title":"Proc. 29th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90004-P_BIB2","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","article-title":"Efficient parallel algorithms for stiring editing and related problems","volume":"19","author":"Apostolico","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90004-P_BIB3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0925-7721(91)90002-V","article-title":"Parallel rectilinear shortest paths with rectangular obstacles","volume":"1","author":"Atallah","year":"1991","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0925-7721(93)90004-P_BIB4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0218035","article-title":"Cascading divide-and-conquer: A technique for designing parallel algorithms","volume":"18","author":"Atallah","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90004-P_BIB5","first-page":"394","article-title":"An efficient parallel algorithm for the row minima of a totally monotone matrix","author":"Atallah","year":"1991","journal-title":"Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0925-7721(93)90004-P_BIB6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0925-7721(93)90004-P_BIB7","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90004-P_BIB8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187714","article-title":"Rectilinear shortest paths in the presence of rectangles barriers","volume":"4","author":"de Rezende","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90004-P_BIB9","unstructured":"H. ElGindy and P. Mitra, Orthogonal shortest route queries among axes parallel rectangular obstacles, Internat. J. Comput. Geom. Appl., to appear."},{"key":"10.1016\/0925-7721(93)90004-P_BIB10","unstructured":"S. Guha and Q. Stout, private communication."},{"key":"10.1016\/0925-7721(93)90004-P_BIB11","first-page":"456","volume":"BIT 23","author":"Nicholl","year":"1983","journal-title":"On the X-Y convex hull of a set of X-Y polygons"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390004P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390004P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:16:03Z","timestamp":1580883363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390004P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["092577219390004P"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90004-p","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}