Suppose one has $n$ perfect two-sided mirror segments in the plane $\mathbb{R}^2$. The segments are open, excluding their endpoints. They are disjoint as closed segments, i.e., no pair shares an endpoint.
Q. Given two points $s$ and $t$, what is the computational complexity of deciding whether or not it is possible to shoot a ray from $s$ and hit $t$ by reflection from the mirrors?
All segments endpoints, and $s$ & $t$, have integer coordinates in $[0,N]$, $N=2^L$. So all coordinates can be represented with $L$ bits.
I've thought about such reflections, but not in terms of computational complexity. And I do not recall this question being addressed in the literature. But perhaps it it is implied by more general results...?
