Triangulating and guarding realistic polygons

被引:0
|
作者
Aloupis, Greg [1 ,2 ]
Bose, Prosenjit [1 ]
Dujmovic, Vida [1 ]
Gray, Chris [3 ]
Langerman, Stefan [4 ]
Speckmann, Bettina [3 ]
机构
[1] Carleton Univ, Ottawa, ON K1S 5B6, Canada
[2] Univ Libre Bruxelles, Brussels, Belgium
[3] TU Eindhoven, Eindhoven, Netherlands
[4] Univ Libre Bruxelles, Chercheur Qualifie FNRS, Brussels, Belgium
来源
关键词
Triangulation; Art gallery; Guarding; Polygon; LINEAR ALGORITHM; CONVEX-HULL; POINT; COMPLEXITY; GALLERIES; POLYHEDRA; OBJECTS; TIME;
D O I
10.1016/j.comgeo.2013.03.005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards. We show that k-guardable polygons generalize two previously identified classes of realistic input. Following this, we give two simple algorithms for triangulating k-guardable polygons. One algorithm requires the guards as input while the other does not. Both take linear time assuming that k is constant and both are easily implementable. (C) 2013 Published by Elsevier B.V.
引用
收藏
页码:296 / 306
页数:11
相关论文
共 50 条