Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
Multidimensional divide-and-conquer
Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Topology Preserving Constrained Graph Layout
Graph Drawing
Integrating edge routing into force-directed layout
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Edge routing with ordered bundles
GD'11 Proceedings of the 19th international conference on Graph Drawing
Winding roads: routing edges into bundles
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Geometry-preserving topological landscapes
Proceedings of the Workshop at SIGGRAPH Asia
Hi-index | 0.00 |
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area involves finding shortest paths in a tangent-visibility graph. However, construction of the full tangent-visibility graph is expensive, at least quadratic time in the number of nodes. In this paper we explore two ideas for achieving faster edge routing using approximate shortest-path techniques.