SCOPUS 정보 검색 플랫폼

Volumn 82, Issue 2, 2002, Pages 99-105

Approximation algorithms for terrain guarding

Author keywords

Approximation algorithms; Computational complexity; Computational geometry; Terrain guarding

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; TERRAIN GUARDING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0037197531 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(01)00255-1 Document Type: Article

Times cited : (52)

References (17)

1
- 0030645273
- Improved low-degree testing and its applications
- (1997) Proc. 29th ACM Symposium on the Theory of Computing, El Paso, TX , pp. 485-495
- Arora, S.¹ Sudan, M.²

3
- 0003373123
- Guarding polyhedral terrains
- (1997) Comput. Geometry , vol.7 , pp. 173-185
- Bose, P.¹ Shermer, T.² Toussaint, G.³ Zhu, B.⁴

4
- 0028330572
- Visibility algorithms on triangulated terrain models
- (1994) Internat. J. Geographic Inform. Systems , vol.8 , Issue.1 , pp. 13-41
- De Floriani, L.¹ Magillo, P.²

7
- 84896748803
- Positioning guards at fixed height above a terrain - An optimum inapproximability result
- Proc. 6th Annual European Symposium on Algorithms - ESA'98, Springer, Berlin
- (1998) Lecture Notes in Comput. Sci. , vol.1461 , pp. 187-198
- Eidenbenz, S.¹ Stamm, C.² Widmayer, P.³

8
- 84867484577
- Inapproximability results for guarding polygons without holes
- Proc. 9th International Symposium on Algorithms and Computation ISAAC'98, Springer, Berlin
- (1998) Lecture Notes in Comput. Sci. , vol.1533 , pp. 427-436
- Eidenbenz, S.¹

9
- 0032108328
- A threshold of ln n for approximating Set Cover
- a preliminary version appeared, Proc. 28th ACM Symposium on the Theory of Computing, Philadelphia, PA, 1996, pp. 314-318
- (1998) J. ACM , vol.45 , Issue.4 , pp. 634-652
- Feige, U.¹

10
- 0008392892
- Approximation algorithms for art gallery problems
- (1987) Proc. Canadian Information Processing Society Congress , pp. 429-434
- Ghosh, S.¹

11
- 0016349356
- Approximation algorithms for combinatorial problems
- (1974) J. Comput. System Sci. , vol.9 , pp. 256-278
- Johnson, D.¹

12
- 0001952756
- Digital elevation models and TIN algorithms
- M. Van Kreveld et al. (Eds.), Algorithmic Foundations of Geographic Information Systems, Springer, Berlin
- (1997) Lecture Notes in Comput. Sci. Tutorial , vol.1340 , pp. 37-78
- Van Kreveld, M.¹

13
- 0022683358
- Computational complexity of art gallery problems
- (1986) IEEE Trans. Inform. Theory , vol.IT-32 , pp. 276-282
- Lee, D.T.¹ Lin, A.K.²

14
- 0003862832
- Oxford University Press, New York
- (1987) Art Gallery Theorems and Algorithms
- O'Rourke, J.¹

15
- 0026923143
- Recent results in art galleries
- (1992) Proc. IEEE , vol.80 , pp. 1384-1399
- Shermer, T.¹

16
- 0002430909
- Art gallery and illumination problems
- J.R. Sack, J. Urrutia (Eds.), Elsevier Science. Amsterdam
- (2000) Handbook on Computational Geometry
- Urrutia, J.¹

17
- 0000681356
- Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time
- (1997) Comput. Geometry , vol.8 , pp. 181-193
- Zhu, B.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.