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 条
  • [31] Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
    Cannon, Sarah
    Fai, Thomas G.
    Iwerks, Justin
    Leopold, Undine
    Schmidt, Christiane
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 68 : 89 - 100
  • [32] Some results on open-edge and open mobile guarding of polygons and triangulations
    Matos, Inês, 1600, Oxford University Press (58):
  • [33] Some Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations
    Bajuelos, Antonio Leslie
    Canales, Santiago
    Hernandez, Gregorio
    Martins, Mafalda
    Matos, Ines
    COMPUTER JOURNAL, 2015, 58 (01): : 160 - 171
  • [34] Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains
    Ashur, Stav
    Filtser, Omrit
    Katz, Matthew J.
    Saban, Rachel
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019), 2020, 11926 : 1 - 17
  • [35] Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
    Ashur, Stav
    Filtser, Omrit
    Katz, Matthew J.
    Saban, Rachel
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2022, 101
  • [36] New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
    Daescu, Ovidiu
    Malik, Hemant
    THEORETICAL COMPUTER SCIENCE, 2021, 882 : 63 - 76
  • [37] triangulating
    Whittaker, Alison
    TRANSITION, 2018, (126) : 71 - 71
  • [38] 'Triangulating'
    Gilbert, Jack
    PARIS REVIEW, 2005, (175): : 81 - 81
  • [39] Triangulating the ROM
    Duffy, D
    JOURNAL OF CANADIAN STUDIES-REVUE D ETUDES CANADIENNES, 2006, 40 (01): : 157 - 181
  • [40] Triangulating with Davidson
    Verheggen, Claudine
    PHILOSOPHICAL QUARTERLY, 2007, 57 (226): : 96 - 103