{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:03Z","timestamp":1725663783686},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_276","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:06:59Z","timestamp":1330258019000},"page":"518-529","source":"Crossref","is-referenced-by-count":4,"title":["Efficient approximate shortest-path queries among isothetic rectangular obstacles"],"prefix":"10.1007","author":[{"given":"Pinaki","family":"Mitra","sequence":"first","affiliation":[]},{"given":"Binay","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and D. Z. Chen, Parallel rectilinear shortest paths with rectangular obstacles, Proc. 2nd Annual ACM Symposium on Parallel Algorithms and Architecture, 1990, pp. 270\u2013279.","DOI":"10.1145\/97444.97694"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"K. Clarkson, Approximation algorithms for shortest path motion planning, Proc. 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 56\u201365.","DOI":"10.1145\/28395.28402"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson, S. Kapoor and P. M. Vaidya, Rectilinear shortest paths through polygonal obstacles, Proc. 3rd Annual Conf. Computational Geometry, 1987, pp. 251\u2013257.","DOI":"10.1145\/41958.41985"},{"key":"48_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187714","volume":"4","author":"P. J. Rezende de","year":"1989","unstructured":"P. J. de Rezende, D. T. Lee and Y. F. Wu, Rectilinear shortest paths in the presence of rectangular obstacles, Discrete Comput. Geom. 4, 1989, pp. 41\u201353.","journal-title":"Discrete Comput. Geom."},{"key":"48_CR5","doi-asserted-by":"publisher","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 connexion with graphs, Numer. Math. 1, 1959, pp. 269\u2013271.","journal-title":"Numer. Math."},{"key":"48_CR6","unstructured":"H. Elgindy and P. Mitra, Orthogonal shortest route queries among axes parallel rectangular obstacles, Int. J. of Comput. Geom. and Applications, to appear."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"L. J. Guibas and J. Hershberger, Optimal shortest path queries in a simple polygon, Proc. 3rd Annual Symposium on Computational Geometry, 1987, pp. 50\u201363.","DOI":"10.1145\/41958.41964"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons, Proc. 2nd Annual Conf. Computational Geometry, 1986, pp. 1\u201313.","DOI":"10.1145\/10515.10516"},{"key":"48_CR9","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 subdivisions, SIAM J. Comp. 12, 1983, pp. 28\u201335.","journal-title":"SIAM J. Comp."},{"key":"48_CR10","unstructured":"D. T. Lee and F. P. Preparata, Eucledian shortest paths among rectilinear barriers, Networks, 11, pp. 393\u2013410."},{"issue":"1","key":"48_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"J. S. B. Mitchell","year":"1992","unstructured":"J. S. B. Mitchell, L 1 shortest paths among polygonal obstacles in the plane, Algorithmica, 8(1), 1992, pp. 55\u201388.","journal-title":"Algorithmica"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"J. S. B. Mitchell, Algorithmic approaches to optimal route planning, Technical Report No. 997, School of Operations Research and Industrial Engineering, Cornell University, 1990.","DOI":"10.1117\/12.25506"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Information Processing Letters 27, 1988, pp. 125\u2013128.","journal-title":"Information Processing Letters"},{"issue":"3","key":"48_CR14","first-page":"321","volume":"36","author":"Y. F. Wu","year":"1987","unstructured":"Y. F. Wu, P. Widmayer, M. D. F. Schlag and C. K. Wong, Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles, IEEE Transactions on Computers, 36(3), 1987, pp. 321\u2013331.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_276.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:23Z","timestamp":1605647303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_276","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}