{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:32:49Z","timestamp":1787495569280,"version":"build-2736575974"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7351,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0925-7721(93)90027-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"1-25","source":"Crossref","is-referenced-by-count":17,"title":["Minimal link visibility paths inside a simple polygon"],"prefix":"10.1016","volume":"3","author":[{"given":"Muhammed H.","family":"Alsuwaiyel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90027-4_BIB1","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\/0925-7721(93)90027-4_BIB2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","article-title":"Watchman routes in simple polygons","volume":"6","author":"Chin","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90027-4_BIB3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02293040","article-title":"An O(nlogn) algorithm for computing the link center of a simple polygon","volume":"8","author":"Djidjev","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90027-4_BIB4","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","article-title":"A linear algorithm for computing the visibility from a point","volume":"2","author":"ElGindy","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90027-4_BIB5","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0925-7721(93)90027-4_BIB6","series-title":"Technical report","article-title":"Detecting the weak visibility of a simple polygon and related problems","author":"Ke","year":"1987"},{"key":"10.1016\/0925-7721(93)90027-4_BIB7","first-page":"328","article-title":"Link length of rectilinear watchman tours in grids","author":"Kranakis","year":"1990","journal-title":"Proc. 2nd Canadian Conf. Comput. Geom."},{"key":"10.1016\/0925-7721(93)90027-4_BIB8","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","article-title":"Computational complexity of art gallery problems","volume":"32","author":"Lee","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0925-7721(93)90027-4_BIB9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","article-title":"An optimal algorithm for finding the kernel of a polygon","volume":"26","author":"Lee","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0925-7721(93)90027-4_BIB10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean shortest paths in the presence of rectilinear barriers","volume":"14","author":"Lee","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0925-7721(93)90027-4_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02187913","article-title":"Computing the link center of a simple polygon","volume":"3","author":"Lenhart","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90027-4_BIB12","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","article-title":"On the complexity of some common geometric problems","volume":"13","author":"Megiddo","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90027-4_BIB13","series-title":"Watchman routes for multiple guards","author":"Mitchell","year":"1991"},{"key":"10.1016\/0925-7721(93)90027-4_BIB14","series-title":"Technical report","article-title":"Scheduling without queuing: The space factory problem","author":"Niedringhaus","year":"1979"},{"key":"10.1016\/0925-7721(93)90027-4_BIB15","first-page":"89","article-title":"Watchman routes under limited visibility","author":"Ntafos","year":"1990","journal-title":"Proc. 2nd Canadian Conf. Comput. Geom."},{"key":"10.1016\/0925-7721(93)90027-4_BIB16","first-page":"75","article-title":"The complexity of computing minimum convex covers for polygons","author":"O'Rourke","year":"1982","journal-title":"Proc. 20th Allerton Conf"},{"key":"10.1016\/0925-7721(93)90027-4_BIB17","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/0925-7721(93)90027-4_BIB18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","article-title":"A linear time algorithm for minimum link-paths inside a simple polygon","volume":"35","author":"Suri","year":"1986","journal-title":"Comput. Vision, Graphics Image Process"},{"key":"10.1016\/0925-7721(93)90027-4_BIB19","series-title":"Ph.D. Thesis","article-title":"Minimum link paths in polygons and related problems","author":"Suri","year":"1987"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:55:48Z","timestamp":1555124148000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772193900274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0925772193900274"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90027-4","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}