{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:49Z","timestamp":1759637629107},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1007\/bf01910637","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T01:32:55Z","timestamp":1122687175000},"page":"474-483","source":"Crossref","is-referenced-by-count":15,"title":["External watchman routes"],"prefix":"10.1007","volume":"10","author":[{"given":"Simeon","family":"Ntafos","sequence":"first","affiliation":[]},{"given":"Laxmi","family":"Gewali","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01910637_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(91)90063-3","volume":"31","author":"PK Agarwal","year":"1991","unstructured":"Agarwal PK, Aggarwal A, Aronov B, Kosaraju SR, Schieber B, Suri S (1991) Computing external farthest neighbors for a simple polygon. Discrete Appl Math 31: 97\u2013111","journal-title":"Discrete Appl Math"},{"key":"BF01910637_CR2","first-page":"155","volume-title":"Proceedings of the 1985 FOCS","author":"T Asano","year":"1985","unstructured":"Asano T, Asano T, Guibas L, Hershberger J, Imai H (1985) Visibility polygon search and euclidean shortest paths. In: Proceedings of the 1985 FOCS. IEEE Computer Society Press, Washington DC, pp 155\u2013164"},{"issue":"no 12","key":"BF01910637_CR3","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D Avis","year":"1981","unstructured":"Avis D, Toussaint G (1981) an optimal algorithm for determining the visibility, of a polygon from an edge. IEEE Trans Comput, Vol C-30, no 12 pp 910\u2013914","journal-title":"IEEE Trans Comput"},{"key":"BF01910637_CR4","series-title":"Proceedings of the 5th ACM Symposium on Computational Geometry","first-page":"247","volume-title":"Determining sector visibility of a polygon","author":"B Bhattacharya","year":"1989","unstructured":"Bhattacharya B, Kirkpatrick D, Toussaint G (1989) Determining sector visibility of a polygon. Proceedings of the 5th ACM Symposium on Computational Geometry. ACM Press, Baldimore, pp 247\u2013253"},{"key":"BF01910637_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","volume":"28","author":"WP Chin","year":"1988","unstructured":"Chin WP, Ntafos S (1988) Optimum watchman routes. Inf Process Lett 28: 39\u201344","journal-title":"Inf Process Lett"},{"key":"BF01910637_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"WP Chin","year":"1991","unstructured":"Chin WP, Ntafos S (1991) Watchman routes in simple polygons. Discrete Comput Geom 6: 9\u201331","journal-title":"Discrete Comput Geom"},{"key":"BF01910637_CR7","first-page":"35","volume-title":"Advances in computing research: computational geometry","author":"H Edelsbrunner","year":"1983","unstructured":"Edelsbrunner H, Overmars M, Wood D (1983) Graphics in flatland. In: Preparata F (ed) Advances in computing research: computational geometry. JAI Press, Greenwich, CN, 1: 35\u201359"},{"key":"BF01910637_CR8","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"SK Ghosh","year":"1991","unstructured":"Ghosh SK, Mount DM (1991) An output-sensitive algorithm for computing visibility graphs. SIAM J Comput 20: 888\u2013910","journal-title":"SIAM J Comput"},{"key":"BF01910637_CR9","first-page":"1","volume-title":"Proceedings of the 2nd ACM Symposium on Computational Geometry","author":"L Guibas","year":"1986","unstructured":"Guibas L, Hershberger J, Leven D, Sharir M, Tarjan R (1986) Linear time algorithms for shortest paths and visibility inside simple polygons. In: Proceedings of the 2nd ACM Symposium on Computational Geometry. ACM Press, Baldimore, pp 1\u201313"},{"key":"BF01910637_CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee DT, Preparata F (1984) Euclidean shortest paths in the presence of rectilinear barriers. Networks 14: 393\u2013410","journal-title":"Networks"},{"key":"BF01910637_CR11","series-title":"Proc. 2nd Conf. Comput Geom","first-page":"269","volume-title":"Optimum watchmen routes in spiral polygons","author":"B Nilsson","year":"1989","unstructured":"Nilsson B, Wood D (1989) Optimum watchmen routes in spiral polygons, Proc. 2nd Conf. Comput Geom. The University of Ottawa, Canada, pp 269\u2013272"},{"key":"BF01910637_CR12","volume-title":"Art gallery theorems and algorithms","author":"J O'Rourke","year":"1987","unstructured":"O'Rourke J (1987) Art gallery theorems and algorithms. Oxford University Press, Oxford"},{"key":"BF01910637_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"F Preparata","year":"1985","unstructured":"Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, Berlin Heidelberg New York"},{"issue":"1","key":"BF01910637_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0031-3203(82)90057-7","volume":"15","author":"G Toussaint","year":"1982","unstructured":"Toussaint G, Avis D (1982) On a convex hull algorithm for polygons and its applications to triangulation problems. Patt Recogn 15 (1): 23\u201329","journal-title":"Patt Recogn"},{"key":"BF01910637_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E Wetzl","year":"1985","unstructured":"Wetzl E (1985) Constructing the visibility graph forn line segments in O(n 2) time. Inf Process Lett 20: 167\u2013171","journal-title":"Inf Process Lett"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01910637.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01910637\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01910637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T12:35:35Z","timestamp":1557491735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01910637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01910637"],"URL":"https:\/\/doi.org\/10.1007\/bf01910637","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}