Asymptotics of d-Dimensional Visibility

arXiv1909.07007MaRDI QIDQ6325364FDOQ6325364

Authors: Ezra Erives, Srinivasan Sathiamurthy, Zarathustra Brady 

Publication date: 16 September 2019

Abstract: We consider the space $[0,n{]}^3$, imagined as a three dimensional, axis-aligned grid world partitioned into $n^3$ $1imes1imes1$ unit cubes. Each cube is either considered to be empty, in which case a line of sight can pass through it, or obstructing, in which case no line of sight can pass through it. From a given position, some of these obstructing cubes block one's view of other obstructing cubes, leading to the following extremal problem: What is the largest number of obstructing cubes that can be simultaneously visible from the surface of an observer cube, over all possible choices of which cubes of $[0,n{]}^3$ are obstructing? We construct an example of a configuration in which $$ obstructing cubes are visible, and generalize this to an example with $$ visible obstructing hypercubes for dimension $d>3$. Using Fourier analytic techniques, we prove an $$ upper bound in a reduced visibility setting.

This page was built for publication: Asymptotics of $d$-Dimensional Visibility

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