Worst-case optimal algorithms for constructing visibility polygons with holes
SCG '86 Proceedings of the second annual symposium on Computational geometry
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Near-optimal sensor placements in Gaussian processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
| Hi-index | 0.00 |
A model for segmentation of an object space by an array of binary, radiation-field sensors and geometric reference structures is described. Given a family of binary, radiation-field sensors and a geometric reference structure, we refer to the set of sensor states induced by a source at point p as the signature of p. We study the segmentation of an object space into signature cells and prove near optimal bounds on the number of distinct signatures induced by a point source, as a function of sensor and reference structure complexity. We also show that almost any family of signatures can be implemented under this model.