{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:41Z","timestamp":1759637861396},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1993,12]]},"abstract":"<jats:p> The problem of finding the shortest watchman route in a simple polygon P through a point s on its boundary is considered. A route is a watchman route if every point inside P can be seen from at least one point along the route. We present an incremental algorithm that constructs the shortest watchman route in O(n<jats:sup>3<\/jats:sup>) time for a simple polygon with n edges. This improves the previous O(n<jats:sup>4<\/jats:sup>) bound. <\/jats:p>","DOI":"10.1142\/s0218195993000233","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"351-365","source":"Crossref","is-referenced-by-count":31,"title":["AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"],"prefix":"10.1142","volume":"03","author":[{"given":"XUEHOU","family":"TAN","sequence":"first","affiliation":[{"name":"School of High-Technology for Human Welfare, Tokai University, 317 Nishino, Numazu 410\u201303, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TOMIO","family":"HIRATA","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya, 464, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YASUYOSHI","family":"INAGAKI","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya, 464, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195993000233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:36:39Z","timestamp":1565192199000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195993000233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1993,12]]}},"alternative-id":["10.1142\/S0218195993000233"],"URL":"https:\/\/doi.org\/10.1142\/s0218195993000233","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}