Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

GD
2009
Springer

favoriteEmaildiscussreport

133views Computer Graphics» more GD 2009»

Fast Edge-Routing for Large Graphs

14 years 3 months ago

Fast Edge-Routing for Large Graphs

Download research.microsoft.com

To produce high quality drawings of graphs with nodes drawn as shapes it is important to ﬁnd routes for the edges which do not intersect node boundaries. Recent work in this area involves ﬁnding 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.

Tim Dwyer, Lev Nachmanson

Real-time Traffic

Computer Graphics | GD 2009 | Node Boundaries | Shortest Paths | Tangent-visibility Graph |

claim paper

Related Content

» Integrating Edge Routing into ForceDirected Layout

» Fast and accurate estimation of shortest paths in large graphs

» Neighborhood based fast graph search in large networks

» Fast minimum spanning tree for large graphs on the GPU

» Exploration of Networks using overviewdetail with Constraintbased cooperative layout

» On the Vulnerability of Large Graphs

» Ghash towards fast kernelbased similarity search in large graph databases

» A Fast Multiscale Method for Drawing Large Graphs

» Fast Katz and Commuters Efficient Estimation of Social Relatedness in Large Networks

Post Info
More Details (n/a)

Added	24 Jul 2010
Updated	24 Jul 2010
Type	Conference
Year	2009
Where	GD
Authors	Tim Dwyer, Lev Nachmanson

Comments (0)