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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Eppstein, D., Van Kreveld, M., Mumford, E., & Speckmann, B. (2007). Edges and switches, tunnels and bridges. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4619 LNCS, pp. 77–88). Springer Verlag. https://doi.org/10.1007/978-3-540-73951-7_8
Mendeley helps you to discover research relevant for your work.