{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:55Z","timestamp":1725664195563},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_219","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:45:20Z","timestamp":1330271120000},"page":"523-530","source":"Crossref","is-referenced-by-count":3,"title":["Shortest safari routes in simple polygons"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-57568-5_235","volume":"762","author":"S. Carlsson","year":"1993","unstructured":"S. Carlsson, H. Jonsson and B.J. Nilsson, Finding the shortest watchman route in a simple polygon, Lect. Notes in Comput. Sci.\n762, 58\u201367, 1993.","journal-title":"Lect. Notes in Comput. Sci."},{"key":"61_CR2","doi-asserted-by":"crossref","unstructured":"B. Chazelle, Triangulating a simple polygon in linear time, Proceedings, 31th Annu. IEEE Symp. Found. of Comput. Sci., 220\u2013229, 1990.","DOI":"10.1109\/FSCS.1990.89541"},{"key":"61_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","volume":"28","author":"W.P. Chin","year":"1988","unstructured":"W.P.Chin and S.Ntafos, Optimum watchman routes, Inform. Process. Lett.\n28, 39\u201344, 1988.","journal-title":"Inform. Process. Lett."},{"key":"61_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"W.P. Chin","year":"1991","unstructured":"W.P.Chin and S.Ntafos, Shortest watchman routes in simple polygons, Discrete Comput. Geometry\n6, 9\u201331, 1991.","journal-title":"Discrete Comput. Geometry"},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0255(92)90072-G","volume":"63","author":"W.P. Chin","year":"1992","unstructured":"W.P.Chin and S.Ntafos, The zookeeper route problem, Inform. Sci.\n63, 245\u2013259, 1992.","journal-title":"Inform. Sci."},{"key":"61_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M.R. Garey","year":"1978","unstructured":"M.R.Garey, D.S.Johnson, F.P.Preparata and R.E.Tarjan, Triangulating a simple polygon, Info. Proc. Lett.\n7, 175\u2013180, 1978.","journal-title":"Info. Proc. Lett."},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L.Guibas, J.Hershberger, D.Leven, M.Sharir and R.Tarjan, Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons, Algorithmica\n2, 209\u2013233, 1987.","journal-title":"Algorithmica"},{"key":"61_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(90)90137-M","volume":"34","author":"S. Ntafos","year":"1990","unstructured":"S.Ntafos, The robber route problem, Inform. Process. Lett.\n34, 59\u201363, 1990.","journal-title":"Inform. Process. Lett."},{"key":"61_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0925-7721(92)90014-J","volume":"1","author":"S. Ntafos","year":"1992","unstructured":"S.Ntafos, Watchman routes under limited visibility, Comput. Geometry: Theory and Applications\n1, 149\u2013170, 1992.","journal-title":"Comput. Geometry: Theory and Applications"},{"key":"61_CR10","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1142\/S0218195993000233","volume":"3","author":"X. Tan","year":"1993","unstructured":"X.Tan, T.Hirata and Y.Inagaki, An incremental algorithm for constructing shortest watchman routes, International Journal of Computational Geometry & Applications\n3, 351\u2013365, 1993.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"61_CR11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-57568-5_236","volume":"762","author":"X. Tan","year":"1993","unstructured":"X.Tan and T.Hirata, Constructing shortest watchman routes by divide-and-conquer, Lect. Note in Comput. Sci.\n762, 68\u201377, 1993.","journal-title":"Lect. Note in Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_219.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:13:43Z","timestamp":1619572423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_219","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}