| Article ID: | iaor201530630 |
| Volume: | 116 |
| Issue: | 3 |
| Start Page Number: | 217 |
| End Page Number: | 222 |
| Publication Date: | Mar 2016 |
| Journal: | Information Processing Letters |
| Authors: | Liotta Giuseppe, Montecchiani Fabrizio |
| Keywords: | graphs, heuristics |
An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is of the form {,,,}, and every edge is either a horizontal or vertical segment. As a byproduct of our drawing technique, we prove that every IC-plane graph has a RAC drawing in quadratic area with at most two bends per edge.