Edges and switches, tunnels and bridges

Authors:
D. Eppstein;M. van Kreveld;E. Mumford;B. Speckmann
Affiliations:
Department of Computer Science, University of California, Irvine;Department of Information and Computing Sciences, Utrecht University;Department of Mathematics and Computer Science, TU Eindhoven;Department of Mathematics and Computer Science, TU Eindhoven
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 4
Cited 3

Faster scaling algorithms for general graph matching problems

Journal of the ACM (JACM)
Testing bipartiteness of geometric intersection graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing maximum indegree

Discrete Applied Mathematics
Algorithmic aspects of proportional symbol maps

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14

Self-overlapping curves revisited

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Testing bipartiteness of geometric intersection graphs

ACM Transactions on Algorithms (TALG)
Motorcycle graphs: canonical quad mesh partitioning

SGP '08 Proceedings of the Symposium on Geometry Processing

Quantified Score

Hi-index	0.00

Visualization

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.