Placing observers to cover a polyhedral terrain in polynomial time

IEEE Workshop on Applications of Computer Vision - Proceedings

Volumn , Issue , 1996, Pages 77-82

  Marengoni, Mauricio ^a   Draper, Bruce A ^a   Hanson, Allen ^a   Sitaraman, Ramesh ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; POLYNOMIALS; THREE DIMENSIONAL COMPUTER GRAPHICS;

ART GALLERY PROBLEM; COMPLEXITY ANALYSIS; POLYHEDRAL TERRAIN; SET COVERAGE;

COMPUTER VISION;

EID: 0030383043     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)