{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:11:00Z","timestamp":1676826660218},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf02523193","type":"journal-article","created":{"date-parts":[[2006,11,7]],"date-time":"2006-11-07T23:41:28Z","timestamp":1162942888000},"page":"281-307","source":"Crossref","is-referenced-by-count":10,"title":["Proximity problems for points on a rectilinear plane with rectangular obstacles"],"prefix":"10.1007","volume":"17","author":[{"given":"S.","family":"Guha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02523193_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01553882","volume":"4","author":"B. Aronov","year":"1989","unstructured":"B. Aronov, On the geodesic Voronoi diagram of point sites in a simple polygon,Algorithmica 4 (1989), 109\u2013140.","journal-title":"Algorithmica"},{"key":"BF02523193_CR2","doi-asserted-by":"crossref","unstructured":"M. J. Atallah, D. Chen, Parallel rectilinear shortest paths with rectangular obstacles,Proc. ACM Symp. on Parallel Algorithms and Architectures, 1990, pp. 270\u2013279. Also inComput. Geom. Theory Appl. 1 (1991), 79\u2013113.","DOI":"10.1016\/0925-7721(91)90002-V"},{"key":"BF02523193_CR3","doi-asserted-by":"crossref","unstructured":"J. L. Bentley, M. I. Shamos, Divide-and-conquer in multidimensional space,Proc. ACM Symp. on Theory of Computing, 1976, pp. 220\u2013230.","DOI":"10.1145\/800113.803652"},{"key":"BF02523193_CR4","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"D. Cheriton, R. E. Tarjan, Finding minimum spanning trees,SIAM J. Comput. 5 (1976), 724\u2013742.","journal-title":"SIAM J. Comput."},{"key":"BF02523193_CR5","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson, S. Kapoor, P. M. Vaidya, Rectilinear shortest paths through polygonal obstacles inO(n(logn)2) time,Proc. ACM Symp. on Computational Geometry, 1987, pp. 251\u2013257.","DOI":"10.1145\/41958.41985"},{"key":"BF02523193_CR6","doi-asserted-by":"crossref","unstructured":"P. J. de Rezende, D. T. Lee, Y. F. Wu, Rectilinear shortest paths with rectangular barriers,Proc. ACM Symp. on Computational Geometry, 1985, pp. 204\u2013213. Also inDiscrete Comput. Geom. 4 (1989), 41\u201353.","DOI":"10.1007\/BF02187714"},{"key":"BF02523193_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","volume":"18","author":"D. Dobkin","year":"1979","unstructured":"D. Dobkin, R. Lipton, On the complexity of computations under varying sets of primitives,J. Comput. System. Sci. 18 (1979), 86\u201391.","journal-title":"J. Comput. System. Sci."},{"key":"BF02523193_CR8","volume-title":"Parallel Algorithms for Polygonal and Rectilinear Geometry","author":"S. Guha","year":"1991","unstructured":"S. Guha, Parallel Algorithms for Polygonal and Rectilinear Geometry, Ph.D. Thesis, Computer Science and Engineering, University of Michigan, Ann Arbor, MI, 1991."},{"key":"BF02523193_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir R. Tarjan, Linear-time algorithms for visibility and shortest path problems inside a triangulated simple polygons,Algorithmica 2 (1987), 209\u2013233.","journal-title":"Algorithmica"},{"key":"BF02523193_CR10","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":"BF02523193_CR11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/net.3230110307","volume":"11","author":"R. C. Larson","year":"1981","unstructured":"R. C. Larson, V. O. Li, Finding minimum rectilinear distance paths in the presence of barriers,Networks 11 (1981), 285\u2013304.","journal-title":"Networks"},{"key":"BF02523193_CR12","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"D. T. Lee","year":"1980","unstructured":"D. T. Lee, Two-dimensional Voronoi diagrams in theL p -metric,J. Assoc. Comput. Mach. 27 (1980), 604\u2013618.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02523193_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1142\/S0218195991000104","volume":"1","author":"D. T. Lee","year":"1991","unstructured":"D. T. Lee, C. D. Yang, T. H. Chen, Shortest rectilinear paths among weighted obstacles,Internat. J. Comput. Geom. Appl. 1 (1991), 109\u2013204.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"BF02523193_CR14","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 (1992), 55\u201388.","journal-title":"Algorithmica"},{"key":"BF02523193_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Prearata","year":"1985","unstructured":"F. P. Prearata, M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."},{"key":"BF02523193_CR16","doi-asserted-by":"crossref","unstructured":"M. I. Shamos, D. Hoey, Closest-point problems,Proc. IEEE Symp. on Foundations of Computer Science, 1975, pp. 151\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"BF02523193_CR17","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/0216049","volume":"16","author":"P. Widmayer","year":"1987","unstructured":"P. Widmayer, Y. F. Wu, C. K. Wong, On some distance problems in fixed orientations,SIAM J. Comput. 16 (1987), 728\u2013246.","journal-title":"SIAM J. Comput."},{"key":"BF02523193_CR18","first-page":"321","volume":"36","author":"Y. F. Wu","year":"1987","unstructured":"Y. F. Wu, P. Widmayer, M. D. F. Schlag, C. K. Wong, Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles,IEEE Trans. Comput. 36 (1987), 321\u2013331.","journal-title":"IEEE Trans. Comput."},{"key":"BF02523193_CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1142\/S0218195992000056","volume":"2","author":"C. D. Yang","year":"1992","unstructured":"C. D. Yang, D. T. Lee, C. K. Wong, On bends and lengths of rectilinear paths: a graph-theoretic approach,Internat. J. Comput. Geom. Appl. 2 (1992), 61\u201374.","journal-title":"Internat. J. Comput. Geom. Appl."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523193.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02523193\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:39:41Z","timestamp":1558283981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02523193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF02523193"],"URL":"https:\/\/doi.org\/10.1007\/bf02523193","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}