Choose your favourite connected graph $\Delta$ and shade a subset $J$ of its vertices. The intersection arrangement associated to the data $(\Delta, J)$ is a collection of real hyperplanes in dimension $|Jc|$, first defined by Iyama and Wemyss. This construction involves taking the classical Coxeter arrangement coming from $\Delta$ and then setting all variables indexed by $J$ to be zero. It turns out that for many choices of $J$ the chambers of the intersection arrangement admit a nice combinatorial description, along with a wall crossing rule to pass between them. I will start by making all this precise before discussing my work to classify tilings of the hyperbolic plane arising as intersection arrangements. This has applications to local notions of stability conditions using the tilting theory of contracted preprojective algebras.
