Pavel Valov, PhD candidate
David R. Cheriton School of Computer Science
Erinn Atwater, PhD candidate
David R. Cheriton School of Computer Science
Philipp Kindermann, Postdoctoral Fellow
David R. Cheriton School of Computer Science
The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges.