Carleton University
Technical Report TR-214
October 1992
Camera Placement in Integer Lattices
Evangelos Kranakis & Michel Pocchiola
Abstract
The camera placement problem concerns the placement of a fixed number of point-cameras on the integer lattice of d-tuples of integers in order to maximize their visibility. We give a caracterization of optimal configurations of size s less than 5d and use it to compute in time O(s logs) an optimal abstract configuration under the assumption that the visibility of a configuration is computable in constant time.