{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:50Z","timestamp":1725663410077},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_60","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:18:36Z","timestamp":1330211916000},"page":"163-175","source":"Crossref","is-referenced-by-count":4,"title":["An incremental algorithm for constructing shortest watchman routes"],"prefix":"10.1007","author":[{"given":"Xue-Hou","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuyoshi","family":"Inagaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"B.Chazelle, Triangulating a simple polygon in linear time, Proceedings, 31th Annu. IEEE Symp. Found. of Comput. Sci.(1990), pp. 220\u2013229.","DOI":"10.1109\/FSCS.1990.89541"},{"key":"19_CR2","doi-asserted-by":"crossref","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":"19_CR3","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 a simple polygon, Discrete Comput. Geometry\n6, 9\u201331, 1991.","journal-title":"Discrete Comput. Geometry"},{"key":"19_CR4","unstructured":"L.Guibas, J.Hershberger, D.Leven, M.Sharir and R.Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons, in Proc. 2nd ACM Symp. Comput. Geometry(1987), pp.1\u201313."},{"key":"19_CR5","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 problems, Inform. Process. Lett.\n34 (1990) 59\u201363.","journal-title":"Inform. Process. Lett."},{"key":"19_CR6","unstructured":"J.O'Rourke, Art Gallery theorems and algorithms, Oxford University Press, 1987."},{"key":"19_CR7","unstructured":"X.H.Tan, T.Hirata and Y.Inagaki, Constructing shortest watchman routes by divide-and-conquer, Manuscript in preparation."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:37Z","timestamp":1619573197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}