Edges and switches, tunnels and bridges

Authors:
David Eppstein;Marc van Kreveld;Elena Mumford;Bettina Speckmann
Affiliations:
Department of Computer Science, University of California, Irvine, USA;Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
Computational Geometry: Theory and Applications
Year:
2009

Citing 6
Cited 1

Faster scaling algorithms for general graph matching problems

Journal of the ACM (JACM)
The haloed line effect for hidden line elimination.

SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
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
Motorcycle graphs: canonical quad mesh partitioning

SGP '08 Proceedings of the Symposium on Geometry Processing

Progress on partial edge drawings

GD'12 Proceedings of the 20th international conference on Graph Drawing

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.