{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:26Z","timestamp":1725542066801},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_106","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"1054-1063","source":"Crossref","is-referenced-by-count":0,"title":["Querying Two Boundary Points for Shortest Paths in a Polygonal Domain"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"106_CR1","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1137\/S0097539794265724","volume":"26","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Sharir, M.: Computing envelopes in four dimensions with applications. SIAM J. Comput.\u00a026(6), 1714\u20131732 (1997)","journal-title":"SIAM J. Comput."},{"key":"106_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/B978-044482537-7\/50003-6","volume-title":"Handbook of Computationaal Geometry","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computationaal Geometry, pp. 49\u2013119. Elsevier Science Publishers B.V, Amsterdam (2000)"},{"key":"106_CR3","unstructured":"Chiang, Y.-J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 215\u2013224 (1999)"},{"issue":"4","key":"106_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in O(n logn) time. Inf. Process. Lett.\u00a033(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"106_CR5","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. Comput.\u00a028(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"106_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"J.S.B. Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Internat. J. Comput. Geom. Appl.\u00a06(3), 309\u2013331 (1996)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"106_CR7","first-page":"607","volume-title":"Handbook of Discrete and Computational Geometry","author":"J.S.B. Mitchell","year":"2004","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Handbook of Discrete and Computational Geometry, 2nd edn., ch.\u00a027, pp. 607\u2013641. CRC Press, Inc., Boca Raton (2004)","edition":"2"},{"key":"106_CR8","doi-asserted-by":"crossref","unstructured":"Nivasch, G.: Improved bounds and new techniques for Davenport-Schinzel sequences and their generatlizations. In: Proc. 20th ACM-SIAM Sympos. Discrete Algorithms, pp. 1\u201310 (2009)","DOI":"10.1137\/1.9781611973068.1"},{"key":"106_CR9","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02574384","volume":"12","author":"M. Sharir","year":"1994","unstructured":"Sharir, M.: Almost tight upper bounds for lower envelopes in higher dimensions. Discrete Comput. Geom.\u00a012, 327\u2013345 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"106_CR10","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:32:00Z","timestamp":1578547920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_106"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}