Computational complexity of art gallery problems
IEEE Transactions on Information Theory
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Boundary evaluation and direct display of CSG models
Computer-Aided Design
An algorithmic approach to some problems in terrain navigation
Artificial Intelligence - Special issue on geometric reasoning
Hybrid shadow testing scheme for ray tracing
Computer-Aided Design
Generalized guarding and partitioning for rectilinear polygons
Computational Geometry: Theory and Applications
Edge guards in rectilinear polygons
Computational Geometry: Theory and Applications
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
The art gallery theorem: its variations, applications and algorithmic aspects
The art gallery theorem: its variations, applications and algorithmic aspects
Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)
Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)
Guard placement for efficient point-in-polygon proofs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Guarding curvilinear art galleries with edge or mobile guards
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Guarding curvilinear art galleries with vertex or point guards
Computational Geometry: Theory and Applications
A combinational approach to polygon similarity
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise-convex polygons, i.e., polygons that are locally convex, except possibly at the vertices, and their edges are convex arcs. We transform the problem of monitoring a piecewise-convex polygon to the problem of 2-dominating a properly defined triangulation graph with edges or diagonals, where 2-dominance requires that every triangle in the triangulation graph has at least two of its vertices in its 2-dominating set. We show that: (1) @?n+13@? diagonal guards are always sufficient and sometimes necessary, and (2) @?2n+15@? edge guards are always sufficient and sometimes necessary, in order to 2-dominate a triangulation graph. Furthermore, we show how to compute: (1) a diagonal 2-dominating set of size @?n+13@? in linear time and space, (2) an edge 2-dominating set of size @?2n+15@? in O(n^2) time and O(n) space, and (3) an edge 2-dominating set of size @?3n7@? in O(n) time and space. Based on the above-mentioned results, we prove that, for piecewise-convex polygons, we can compute: (1) a mobile guard set of size @?n+13@? in O(nlogn) time, (2) an edge guard set of size @?2n+15@? in O(n^2) time, and (3) an edge guard set of size @?3n7@? in O(nlogn) time. All space requirements are linear. Finally, we show that @?n3@? mobile or @?n3@? edge guards are sometimes necessary. When restricting our attention to monotone piecewise-convex polygons, the bounds mentioned above drop: @?n+14@? edge or mobile guards are always sufficient and sometimes necessary; such an edge or mobile guard set, of size at most @?n+14@?, can be computed in O(n) time and space.