Edges and switches, tunnels and bridges

  • Eppstein D
  • Van Kreveld M
  • Mumford E
 et al. 
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 5

    Citations

    Citations of this article.

Abstract

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

  • Edge casing
  • Graph drawing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • David Eppstein

  • Marc Van Kreveld

  • Elena Mumford

  • Bettina Speckmann

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free