Camera placement in integer lattices
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.
- Camera placement in integer lattices
- scientific article; zbMATH DE number 3143963 (Why is no real title available?)
- scientific article; zbMATH DE number 3903454 (Why is no real title available?)
- scientific article; zbMATH DE number 3905351 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 42453 (Why is no real title available?)
- scientific article; zbMATH DE number 3553317 (Why is no real title available?)
- scientific article; zbMATH DE number 3248272 (Why is no real title available?)
- scientific article; zbMATH DE number 3257531 (Why is no real title available?)
- Metric-Affine Gauge Theory of Gravity: I. Fundamental Structure and Field Equations
- Sets of visible points
- Some results in combinatorial geometry
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)