Camera placement in integer lattices

From MaRDI portal





The authors study the following camera placement problem in the \(d\)- dimensional integer lattice: Given an integer \(s\), determine a configuration \(S\) of \(s\) lattice points such that the density of lattice points visible by at least one point of \(S\) is maximized. This problem is analyzed for complete integer lattices. The combinatorial part has been reduced to an instance of a general integer optimization problem involving absolute monotone functions. The optimal configuration of size up to \(3^ d\) in \(d\) dimensions is characterized in simple terms.











This page was built for publication: Camera placement in integer lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330888)