{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:19:01Z","timestamp":1778278741099,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540688655","type":"print"},{"value":"9783540688808","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_20","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"200-211","source":"Crossref","is-referenced-by-count":5,"title":["Shortest Path Queries in Polygonal Domains"],"prefix":"10.1007","author":[{"given":"Hua","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"20_CR1","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J. Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Computing\u00a028(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Computing"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009323","volume":"18","author":"S. Kapoor","year":"1997","unstructured":"Kapoor, S., Maheshwari, S.N., Mitchell, J.S.B.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discete Comput. Geom.\u00a018, 377\u2013383 (1997)","journal-title":"Discete Comput. Geom."},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63307-3_64","volume-title":"Algorithms and Data Structures","author":"D.Z. Chen","year":"1997","unstructured":"Chen, D.Z., Daescu, O., Klenk, K.S.: On geometric path query problems. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 248\u2013257. Springer, Heidelberg (1997)"},{"key":"20_CR4","unstructured":"Chiang, Y.J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: SODA 1999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 215\u2013224 (1999)"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L. Guibas","year":"1989","unstructured":"Guibas, L., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. (JCSS)\u00a039(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci. (JCSS)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1147\/rd.313.0361","volume":"31","author":"V. Srinivasan","year":"1987","unstructured":"Srinivasan, V., Nackman, L.R.: Voronoi diagram for multiply-connected polygonal domains I: algorithm. IBM Journal of Research and Development\u00a031(3), 361\u2013372 (1987)","journal-title":"IBM Journal of Research and Development"},{"issue":"7","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1360\/jos171527","volume":"17","author":"C.L. Yang","year":"2006","unstructured":"Yang, C.L., Wang, J.Y., Meng, X.X.: Upper bounds on the size of inner Voronoi diagrams of multiply connected polygons. J. Software\u00a017(7), 1527\u20131534 (2006)","journal-title":"J. Software"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput.\u00a012, 28\u201335 (1983)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:02Z","timestamp":1620015422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}