{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:18:49Z","timestamp":1775063929176,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1007\/bf02187714","type":"journal-article","created":{"date-parts":[[2005,9,20]],"date-time":"2005-09-20T18:57:34Z","timestamp":1127242654000},"page":"41-53","source":"Crossref","is-referenced-by-count":64,"title":["Rectilinear shortest paths in the presence of rectangular barriers"],"prefix":"10.1007","volume":"4","author":[{"given":"P. J.","family":"de Rezende","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. F.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1989,1,1]]},"reference":[{"key":"BF02187714_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"V. Aho","year":"1984","unstructured":"V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1984."},{"key":"BF02187714_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility of disjoint polygons,Algorithmica 1 (1986h), 49\u201363.","journal-title":"Algorithmica"},{"key":"BF02187714_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Lower bounds for algebraic computation trees,Proceedings of the 15th ACM Annual Symposium on Theory of Computing, 80\u201386, Boston, MA, 1983.","DOI":"10.1145\/800061.808735"},{"key":"BF02187714_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra, A note on two problems in connection with graphs,Numer. Math. 1 (1959), 269\u2013271.","journal-title":"Numer. Math."},{"key":"BF02187714_CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision,SIAM J. Comput. 15 (1986), 317\u2013340.","journal-title":"SIAM J. Comput."},{"key":"BF02187714_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick, Optimal search in planar subdivision,SIAM J. Comput. 12 (1983), 28\u201335.","journal-title":"SIAM J. Comput."},{"key":"BF02187714_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/net.3230110307","volume":"11","author":"R. C. Larson","year":"1981","unstructured":"R. C. Larson and V. O. Li, Finding minimum rectilinear distance paths in the presence of barriers,Networks 11 (1981), 285\u2013304.","journal-title":"Networks"},{"key":"BF02187714_CR8","unstructured":"D. T. Lee, Proximity and Reachability in the Plane, Ph.D. Thesis, University of Illinois, 1978."},{"key":"BF02187714_CR9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee and F. P. Preparata, Euclidean shortest paths in the presence of rectilinear barriers,Networks 14 (1984), 393\u2013410.","journal-title":"Networks"},{"key":"BF02187714_CR10","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"T. Lozano-Perez and M. A. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles,Comm. ACM 22 (1979), 560\u2013570.","journal-title":"Comm. ACM"},{"key":"BF02187714_CR11","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"N. Sarnak and R. Tarjan, Planar point location using persistent search trees,Comm. ACM 29 (1986), 669\u2013679.","journal-title":"Comm. ACM"},{"key":"BF02187714_CR12","volume-title":"Computational Geometry","author":"M. I. Shamos","year":"1978","unstructured":"M. I. Shamos, Computational Geometry, Ph.D. Thesis, Yale University, New Haven, CT, 1978."},{"key":"BF02187714_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"M. Sharir and A. Schorr, On shortest paths in polyhedral spaces,SIAM J. Comput. 15 (1986), 193\u2013215.","journal-title":"SIAM J. Comput."},{"key":"BF02187714_CR14","unstructured":"H. Vaccaro, Alternative Techniques for Modeling Travel Distance, Thesis in Civil Engineering, Massachusetts Institute of Technology, 1974."},{"key":"BF02187714_CR15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.5957\/jsr.1974.18.1.46","volume":"18","author":"G. E. Wangdahl","year":"1974","unstructured":"G. E. Wangdahl, S. M. Pollack, and J. B. Woodward, Minimum-trajectory pipe routing,J. Ship Res. 18 (1974), 46\u201349.","journal-title":"J. Ship Res."},{"key":"BF02187714_CR16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"18","author":"E. Welzl","year":"1985","unstructured":"E. Welzl, Constructing the visibility graph forn line segments inO(n 2) time,Inform. Process. Lett. 18 (1985), 167\u2013171.","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187714.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187714\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T21:52:58Z","timestamp":1626558778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["BF02187714"],"URL":"https:\/\/doi.org\/10.1007\/bf02187714","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}