{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T05:55:56Z","timestamp":1775109356313,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0020-0190(03)00284-9","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T16:38:29Z","timestamp":1055176709000},"page":"179-186","source":"Crossref","is-referenced-by-count":30,"title":["Finding shortest safari routes in simple polygons"],"prefix":"10.1016","volume":"87","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":"78","reference":[{"key":"10.1016\/S0020-0190(03)00284-9_BIB001","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(03)00284-9_BIB002","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","article-title":"Optimum watchman routes","volume":"28","author":"Chin","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(03)00284-9_BIB003","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","article-title":"Shortest watchman routes in simple polygons","volume":"6","author":"Chin","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(03)00284-9_BIB004","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0020-0255(92)90072-G","article-title":"The zookeeper route problem","volume":"63","author":"Chin","year":"1992","journal-title":"Inform. Sci."},{"key":"10.1016\/S0020-0190(03)00284-9_BIB005","series-title":"Proc. 2nd ACM\u2013SIAM Symp. Discrete Algorithms","first-page":"459","article-title":"The aquarium keeper's problem","author":"Czyzowicz","year":"1991"},{"key":"10.1016\/S0020-0190(03)00284-9_BIB006","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(03)00284-9_BIB007","series-title":"Proc. 6th Canadian Conf. on Comput. Geom.","first-page":"104","article-title":"An efficient solution to the zookeeper's problem","author":"Hershberger","year":"1994"},{"key":"10.1016\/S0020-0190(03)00284-9_BIB008","series-title":"Proc. FCT'97","first-page":"210","article-title":"Concerning the time bounds of existing shortest watchman route algorithms","volume":"1279","author":"Hammar","year":"1997"},{"key":"10.1016\/S0020-0190(03)00284-9_BIB009","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0925-7721(92)90014-J","article-title":"Watchman routes under limited visibility","volume":"1","author":"Ntafos","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0020-0190(03)00284-9_BIB010","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1142\/S0218195993000233","article-title":"An incremental algorithm for constructing shortest watchman routes","volume":"3","author":"Tan","year":"1993","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0020-0190(03)00284-9_BIB011","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1142\/S0218195999000212","article-title":"Corrigendum to \u201cAn incremental algorithm for constructing shortest watchman routes\u201d","volume":"9","author":"Tan","year":"1999","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0020-0190(03)00284-9_BIB012","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0020-0190(00)00146-0","article-title":"Fast computation of shortest watchman routes in simple polygons","volume":"77","author":"Tan","year":"2001","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002849?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002849?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T18:02:21Z","timestamp":1553104941000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0020019003002849"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00284-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}