A randomized art-gallery algorithm for sensor placement

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 232-240

  Gonzalez Banos H ^a   Latombe, J C ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; PROBABILITY; RANGE FINDERS; SENSORS;

VISUAL SENSING;

MOBILE ROBOTS;

EID: 0034819443     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378674     Document Type: Conference Paper

References (20)

1. A "next-best-view" algorithm for three-dimensional scene reconstruction using range images
2. Triangulations
3. Product range spaces, sensitive sampling, and derandomization
4. Almost optimal set covers in finite vc-dimension
5. The determination of next best views
6. A volumetric method for building complex models from range images
7. Randomized planning for short inspection paths
8. Planning robot motion strategies for efficient model construction
9. Light field rendering
10. Occlusions as a guide for planning the next view
11. Visibility
12. Recent results in art galleries
13. A tight analysis of the greedy algorithm for set cover
14. Point location
15. Zippered polygon meshes from range images
16. Art gallery and illumination problems
17. Viewpoint selection for visual search