{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:21:12Z","timestamp":1758266472657},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_236","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:11:46Z","timestamp":1330261906000},"page":"68-77","source":"Crossref","is-referenced-by-count":12,"title":["Constructing shortest watchman routes by divide-and-conquer"],"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,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"B. Chazelle, A theorem on polygon cutting with applications, Proceedings, 23th Annu. IEEE Symp. Found. of Comput. Sci., 339\u2013349, 1982.","key":"8_CR1","DOI":"10.1109\/SFCS.1982.58"},{"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.","key":"8_CR2","DOI":"10.1109\/FSCS.1990.89541"},{"key":"8_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":"8_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":"8_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H.Edelsbrunner, J.O'Rourke and R.Seidel, Constructing arrangements of lines with applications. SIAM J. Comput.\n15, 341\u2013363, 1986.","journal-title":"SIAM J. Comput."},{"key":"8_CR6","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":"8_CR7","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":"8_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/3-540-54945-5_60","volume":"557","author":"X.H. Tan","year":"1991","unstructured":"X.H.Tan, T.Hirata and Y.Inagaki, An incremental algorithm for constructing shortest watchman routes, To appear in Internationa Journal of Computational Geometry & Applications (also in Lect. Note in Comput. Sci.\n557, 163\u2013175, 1991).","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-57568-5_236.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:06:17Z","timestamp":1619571977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_236","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}