Guarding two subclasses of orthogonal polygons

被引:0
作者
Martins, Ana Mafalda [1 ]
Bajuelos, Antonio Leslie [1 ]
机构
[1] Univ Aveiro, CEOC, Aveiro, Portugal
来源
RECENT PROGRESS IN COMPUTATIONAL SCIENCES AND ENGINEERING, VOLS 7A AND 7B | 2006年 / 7A-B卷
关键词
computational geometry; art gallery problems; orthogonal polygon; spiral polygon;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper we consider the Minimum Vertex Guard problem for THIN grid n-ogons, which are a subclass of orthogonal polygons. As a step for the resolution of this general problem, we are going to study it for two subclasses of THIN grid n-ogons: the MIN-AREA and the SPIRAL grid n-ogons.
引用
收藏
页码:372 / 375
页数:4
相关论文
共 8 条
[1]  
[Anonymous], 1987, ART GALLERY THEOREMS
[2]  
Bajuelos AL, 2004, LECT NOTES COMPUT SC, V3045, P127
[3]   DECOMPOSITION OF POLYGONS INTO SIMPLER COMPONENTS - FEATURE GENERATION FOR SYNTACTIC PATTERN-RECOGNITION [J].
FENG, HYF ;
PAVLIDIS, T .
IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (06) :636-650
[4]  
Martins A. M., 2005, International Conference on Numerical Analysis and Applied Mathematics 2005 ICNAAM 2005, P361
[5]  
Martins AM, 2006, LECT NOTES COMPUT SC, V3992, P255, DOI 10.1007/11758525_34
[6]  
Nilsson B. J., 1990, P CAN C COMP GEOM, P269
[7]  
Pavlidis T., 1977, SYNTACTIC PATTERN RE, P125
[8]  
URRUTIAL J, 2000, HDB COMPUTATIONAL GE