A Greedy Heuristic for Crossing-Angle Maximization

Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze +2

The crossing angle of a straight-line drawing $\Gamma$ of a graph $G=(V,E)$ is the smallest angle between two crossing edges in $\Gamma$. Deciding whether a graph $G$ has a straight-line dr…