Routing in Histograms

Man-Kwun Chiu, Jonas Cleve, Katharina Klost +5

Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizonta…