Browsing Eurographics Workshops and Symposia by Subject "G.2.2 [Discrete Mathematics]"
Now showing items 1-1 of 1
-
ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
(The Eurographics Association and Blackwell Publishing Ltd., 2011)PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar ...