{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:17Z","timestamp":1725795137756},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_21","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"229-239","source":"Crossref","is-referenced-by-count":0,"title":["Finding Simple Paths on Given Points in a Polygonal Region"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Candian Conf. on Comput. Geom., pp. 38\u201344 (1996)","DOI":"10.1515\/9780773591134-009"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Moshe, B., Hall-Holt, O., Katz, M.J., Mitchell, J.S.B.: Computing the visibility graph of points within a polygon. In: Proc. ACM Sympos. Comput. Geom., pp. 27\u201335 (2004)","DOI":"10.1145\/997817.997825"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0925-7721(00)00011-0","volume":"16","author":"Q. Cheng","year":"2000","unstructured":"Cheng, Q., Chrobak, M., Sundaram, G.: Computing simple paths among obstacles. Comput. Geom.\u00a016, 223\u2013233 (2000)","journal-title":"Comput. Geom."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom.\u00a04, 551\u2013581 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"21_CR5","unstructured":"Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 3nd edn. The MIT Press (2009)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-89550-3_5","volume-title":"Computational Geometry and Graph Theory","author":"O. Daescu","year":"2008","unstructured":"Daescu, O., Luo, J.: Computing simple paths on points in simple polygons. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds.) KyotoCGGT 2007. LNCS, vol.\u00a04535, pp. 41\u201355. Springer, Heidelberg (2008)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci.\u00a039, 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(91)90064-O","volume":"38","author":"J. Hershberger","year":"1991","unstructured":"Hershberger, J.: A new data structure for shortest path queries in a simple polygon. Inform. Process. Lett.\u00a038, 231\u2013235 (1991)","journal-title":"Inform. Process. Lett."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0925-7721(95)00031-3","volume":"6","author":"C. Zhou","year":"1996","unstructured":"Zhou, C., Sundaram, G., Snoeyink, J., Mitchell, J.S.B.: Generating random polygons with given vertices. Comput. Geom.\u00a06, 277\u2013290 (1996)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T04:53:25Z","timestamp":1716785605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}