{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:12:49Z","timestamp":1778497969762,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"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":[[2002,3]]},"DOI":"10.1016\/s0925-7721(01)00029-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:36:39Z","timestamp":1027589799000},"page":"139-153","source":"Crossref","is-referenced-by-count":7,"title":["Inapproximability of finding maximum hidden sets on polygons and terrains"],"prefix":"10.1016","volume":"21","author":[{"given":"Stephan","family":"Eidenbenz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00029-3_BIB001","series-title":"Approximation Algorithms for NP-Hard Problems","first-page":"399","article-title":"Hardness of approximations","author":"Arora","year":"1996"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB002","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":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB003","series-title":"Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties","article-title":"A compendium of NP optimization problems","author":"Crescenzi","year":"1999"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB004","series-title":"Proc. of ISAAC '98","first-page":"427","article-title":"Inapproximability results for guarding polygons without holes","volume":"1533","author":"Eidenbenz","year":"1998"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB005","series-title":"Proc. of ISAAC '99","first-page":"184","article-title":"How many people can hide in a terrain?","volume":"1741","author":"Eidenbenz","year":"1999"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB006","series-title":"Proc. of 10th Canadian Conf. Computational Geometry","first-page":"64","article-title":"Inapproximability of some Art Gallery problems","author":"Eidenbenz","year":"1998"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB007","series-title":"Proc. of ESA '98","first-page":"187","article-title":"Positioning guards at fixed height above a terrain \u2013 an optimum inapproximability result","volume":"1461","author":"Eidenbenz","year":"1998"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB008","series-title":"Handbook of Discrete and Computational Geometry","year":"1997"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB009","series-title":"Proc. of the Symposium on Foundations of Computer Science","article-title":"Clique is hard to approximate within n1\u2212\u03b5","author":"Hastad","year":"1996"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB010","series-title":"Proc. of the Symposium on Theory of Computing","first-page":"770","article-title":"Efficient computation of geodesic shortest paths","author":"Kapoor","year":"1999"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB011","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB012","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB013","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02239742","article-title":"Hiding people in polygons","volume":"42","author":"Shermer","year":"1989","journal-title":"Computing"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB014","doi-asserted-by":"crossref","DOI":"10.1109\/5.163407","article-title":"Recent results in Art Galleries","author":"Shermer","year":"1992","journal-title":"Proc. of the IEEE"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB015","article-title":"Art Gallery and illumination problems","author":"Urrutia","year":"1998"},{"key":"10.1016\/S0925-7721(01)00029-3_BIB016","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\/S0925-7721(01)00029-3_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":"Computational Geometry"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000293?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000293?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:51:41Z","timestamp":1556509901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0925772101000293"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00029-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}