{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:28Z","timestamp":1763467468209},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":[[2002,4]]},"DOI":"10.1016\/s0020-0190(01)00255-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"99-105","source":"Crossref","is-referenced-by-count":40,"title":["Approximation algorithms for terrain guarding"],"prefix":"10.1016","volume":"82","author":[{"given":"Stephan","family":"Eidenbenz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00255-1_BIB001","series-title":"Proc. 29th ACM Symposium on the Theory of Computing, El Paso, TX","first-page":"485","article-title":"Improved low-degree testing and its applications","author":"Arora","year":"1997"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB002","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"2000"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB003","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0925-7721(95)00034-8","article-title":"Guarding polyhedral terrains","volume":"7","author":"Bose","year":"1997","journal-title":"Comput. Geometry"},{"issue":"1","key":"10.1016\/S0020-0190(01)00255-1_BIB004","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/02693799408901985","article-title":"Visibility algorithms on triangulated terrain models","volume":"8","author":"De Floriani","year":"1994","journal-title":"Internat. J. Geographic Inform. Systems"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB005","series-title":"(In-)Approximability of visibility problems on polygons and terrains; PhD thesis, Diss. ETH No. 13683","author":"Eidenbenz","year":"2000"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB006","series-title":"Proc. 10th Canadian Conf. Computational Geometry (CCCG'98), Montreal, Quebec","first-page":"64","article-title":"Inapproximability of some art gallery problems","author":"Eidenbenz","year":"1998"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB007","series-title":"Proc. 6th Annual European Symposium on Algorithms \u2014 ESA'98","first-page":"187","article-title":"Positioning guards at fixed height above a terrain \u2014 an optimum inapproximability result","volume":"1461","author":"Eidenbenz","year":"1998"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB008","series-title":"Proc. 9th International Symposium on Algorithms and Computation ISAAC'98","first-page":"427","article-title":"Inapproximability results for guarding polygons without holes","volume":"1533","author":"Eidenbenz","year":"1998"},{"issue":"4","key":"10.1016\/S0020-0190(01)00255-1_BIB009","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of lnn for approximating Set Cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB010","series-title":"Proc. Canadian Information Processing Society Congress","first-page":"429","article-title":"Approximation algorithms for art gallery problems","author":"Ghosh","year":"1987"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB011","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00255-1_BIB012","series-title":"Algorithmic Foundations of Geographic Information Systems","first-page":"37","article-title":"Digital elevation models and TIN algorithms","volume":"1340","author":"van Kreveld","year":"1997"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB013","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","article-title":"Computational complexity of art gallery problems","volume":"IT-32","author":"Lee","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB014","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB015","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/5.163407","article-title":"Recent results in art galleries","volume":"80","author":"Shermer","year":"1992","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB016","series-title":"Handbook on Computational Geometry","article-title":"Art gallery and illumination problems","author":"Urrutia","year":"2000"},{"key":"10.1016\/S0020-0190(01)00255-1_BIB017","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0925-7721(96)00009-0","article-title":"Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time","volume":"8","author":"Zhu","year":"1997","journal-title":"Comput. Geometry"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T02:28:05Z","timestamp":1556850485000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0020019001002551"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00255-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}