{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:26Z","timestamp":1725664526855},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:32:12Z","timestamp":1330277532000},"page":"76-87","source":"Crossref","is-referenced-by-count":1,"title":["Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles"],"prefix":"10.1007","author":[{"given":"Pinaki","family":"Mitra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"7_CR1","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 with rectangular barrier, Discrete Computational Geometry, vol. 4, 1989, pp. 41\u201353.","journal-title":"Discrete Computational Geometry"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"H. Elgindy and P. Mitra, Orthogonal shortest path queries among axes parallel rectangular obstacles, International Journal of Computational Geometry and Applications, 1994.","DOI":"10.1142\/S0218195994000021"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"S. Guha and I. Suzuki, Proximity problems for points on rectilinear plane with rectangular obstacles, Proc. FST & TCS \u2014 13, Lecture Notes in Computer Science, 1993, pp. 218\u2013227.","DOI":"10.1007\/3-540-57529-4_55"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"D. B. Johnson, Efficient algorithms for shortest paths in sparse network, Journal of the Association of Computing Machinery, 1977, pp. 1\u201313.","DOI":"10.1145\/321992.321993"},{"key":"7_CR5","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 Journal on Computing, vol. 12, 1983, pp. 28\u201335.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR6","doi-asserted-by":"crossref","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 problems in graphs, Information Processing Letters, vol. 27, 1988, pp. 125\u2013128.","journal-title":"Information Processing Letters"},{"key":"7_CR7","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 L shortest paths among polygonal obstacles in the plane, Algorithmica, vol. 8, 1992, pp. 55\u201388.","journal-title":"Algorithmica"},{"key":"7_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry \u2014 an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry \u2014 an Introduction, Springer-Verlag, New York, 1985."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:11:34Z","timestamp":1605629494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}