Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
Voronoi diagrams with barriers and the shortest diagonal problem
Information Processing Letters
Introduction to algorithms
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
On the Peeper's Voronoi diagram
ACM SIGACT News
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Finding constrained and weighted Voronoi diagrams in the plane
Computational Geometry: Theory and Applications
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Approximation schemes in computational geometry
Approximation schemes in computational geometry
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Computing best coverage path in the presence of obstacles in a sensor field
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We compute BCP(s,t), a Best Coverage Path between two points s and t in the presence of m line segment obstacles in a 2D field under surveillance by n sensors. Based on nature of obstacles, we have studied two variants of the problem. For opaque obstacles, which obstruct paths and block sensing capabilities of sensors, we present algorithm ExOpaque for computation of BCP(s,t) that takes O((m^2n^2+n^4)log(mn+n^2)) time and O(m^2n^2+n^4) space. For transparent obstacles, which only obstruct paths but allow sensing, we present an exact as well as an approximation algorithm, where the exact algorithm ExTransparent takes O(n(m+n)^2(logn+log(m+n))) time and O(n(m+n)^2) space. On the other hand, the approximation algorithm ApproxTransparent takes O(n(m+n)(logn+log(m+n))) time and O(n(m+n)) space with an approximation factor of O(k), using k-spanners of visibility graph.