Before revision: The visual complexity of a plane graph drawing is defined to be the number of basic 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 a pathwith an arbitrary number of edges).
After revision: The visual complexity of a plane graph drawing is defined to be the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are represented by few segments. In such a drawing, one segment may represent multiple edges (e.g., one needs only one line segment to draw a pathwith an arbitrary number of edges).