Edges and switches, tunnels and bridges

Citations of this article
Mendeley users who have this article in their library.
Get full text


Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the lower edge in an appropriate neighborhood of the crossing. Certain orders will lead to a more readable drawing than others. We formulate several optimization criteria that try to capture the concept of a "good" cased drawing. Further, we address the algorithmic question of how to turn a given drawing into an optimal cased drawing. For many of the resulting optimization problems, we either find polynomial time algorithms or NP-hardness results. © 2009 Elsevier B.V. All rights reserved.

Author supplied keywords




Eppstein, D., Van Kreveld, M., Mumford, E., & Speckmann, B. (2009). Edges and switches, tunnels and bridges. In Computational Geometry: Theory and Applications (Vol. 42, pp. 790–802). https://doi.org/10.1016/j.comgeo.2008.05.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free