2013/09/03 by Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe +1
#Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.1309.0683
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V,E) and a function γ:V → \1,2,…,k\ and asks whether a planar drawing of G exists such that each edge is monotone in the y-direction and, for any u,v∈ V with γ(u)