{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:51Z","timestamp":1725455511160},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620488"},{"type":"electronic","value":"9783540496335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0009507","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:32:17Z","timestamp":1129804337000},"page":"305-314","source":"Crossref","is-referenced-by-count":2,"title":["k-pairs non-crossing shortest paths in a simple polygon"],"prefix":"10.1007","author":[{"given":"Evanthia","family":"Papadopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,11]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"B. Chazelle, \u201cA theorem on polygon cutting with applications\u201d, Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci., 1982, pp. 339\u2013349.","DOI":"10.1109\/SFCS.1982.58"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B. Chazelle","year":"1994","unstructured":"B. Chazelle, H. Eddelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink, \u201cRay shooting in polygons using geodesic triangualtions\u201d, Algorithmica, 12, 1994, 54\u201368.","journal-title":"Algorithmica"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich and R. Tamassia, \u201cDynamic Ray Shooting and Shortest Paths via Balanced Geodesic Triangualtions\u201d, In Proc. 9th Annu. ACM Sympos. Comput. Geom, 1993, 318\u2013327.","DOI":"10.1145\/160985.161157"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"L.J. Guibas and J. Hershberger, \u201cOptimal shortest path queries in a simple polygon\u201d, J. Comput. Syst. Sci., 39, 1989, 126\u2013152.","journal-title":"J. Comput. Syst. Sci."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan, \u201cLinear-time algorithms for visibility and shortest path problems inside triangulated simple polygons\u201d. Algorithmica, 2, 209\u2013233, 1987.","journal-title":"Algorithmica"},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J. Hershberger","year":"1994","unstructured":"J. Hershberger and J. Snoeyink, \u201cComputing Minimum Length Paths of a given homotopy class\u201d, Comput. Geometry: Theory and Applications, 4, 1994, 63\u201397.","journal-title":"Comput. Geometry: Theory and Applications"},{"key":"32_CR7","unstructured":"D.T. Lee, \u201cNon-crossing paths problems\u201d, Manuscript, Dept. of EECS, Northwestern University, 1991."},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee and F. P. Preparata, \u201cEuclidean Shortest Paths in the Presence of Rectilinear Barriers\u201d, Networks, 14 1984, 393\u2013410.","journal-title":"Networks"},{"key":"32_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M. I. Shamos, Computational Geometry: an Introduction, Springer-Verlag, New York, NY 1985."},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-57568-5_239","volume":"762","author":"J. Takahashi","year":"1993","unstructured":"J. Takahashi, H. Suzuki, and T. Nishizeki, \u201cFinding shortest non-crossing rectilinear paths in plane regions\u201d, Proc. of ISAAC'93, Lect. Notes in Computer Science, Spinger-Verlag, 762, 1993, 98\u2013107.","journal-title":"Proc. of ISAAC'93, Lect. Notes in Computer Science, Spinger-Verlag"},{"key":"32_CR11","unstructured":"J. Takahashi, H. Suzuki, and T. Nishizeki, \u201cShortest non-crossing rectilinear paths in plane regions\u201d, Algorithmica, to appear."},{"key":"32_CR12","unstructured":"J. Takahashi, H. Suzuki, and T. Nishizeki, \u201cShortest non-crossing paths in plane graphs\u201d, Algorithmica, to appear."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0009507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T07:13:05Z","timestamp":1586502785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620488","9783540496335"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0009507","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}