Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2008.15-A.5.295

A Triangulation and Guard Sufficiency Set of the Hierarchy of Simple Polygons  

Yang, Tae-Cheon (경성대학교 컴퓨터정보학부)
Publication Information
The KIPS Transactions:PartA / v.15A, no.5, 2008 , pp. 295-300 More about this Journal
Abstract
In this paper, we consider a characterization of a Guard Sufficiency Set(GSS) in the hierarchy of simple polygons. we propose the diagonals of a arbitrary triangulation of a polygon as a GSS when guards see the diagonals with completely visibility and both sides of the diagonal. we show that this can be a GSS in convex polygons, unimodal polygons, spiral polygons but this can not be a GSS in star-shaped polygons, monotone polygons, completely external visible polygons.
Keywords
Computational Geometry; Art Gallery Problem; Visibility; Guard Sufficiency Set; Polygon Hierarchy; Triangulation; Completely Visibility;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. T. Toussaint, "Movable separability of sets," in Computational Geometry, Ed., G. T. Toussaint, North-Holland, 1985, pp.335-375
2 D. T. Lee and A. K. Lin, "Computational complexity of art gallery problems," IEEE Transactions on Information Theory, 32:276-282, 1986   DOI
3 J. Urrutia, "Art Gallery and Illumination Problems" Handbook on Computational Geometry, Elsevier Science Publishers, J.R. Sack and J. Urrutia eds. pp.973-1026, 2000
4 양태천, 신찬수, "단순다각형에서의 경비 가능 충분 집합," 한국정보과학회 논문지, 제28권 제1.2호, 2001   과학기술학회마을
5 A. Aggarwal, The art gallery problem: Its variations, applications, and algorithmic aspects. PhD thesis, Johns Hopkins University, 1984
6 S. Eidenbenz, C. Stamm, and P. Widmayer, "Inapproximability results for guarding polygons and terrains," Algorithmica, 31(1):79-113, 2001   DOI
7 J. O'rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987
8 T. Shermer, Recent Results in Art Galleries. Proceedings of the IEEE 80: 1384-1399, 1992   DOI   ScienceOn