ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges

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 graph drawing algorithms, interacting with a graph layout, and drawing Euler‐li...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer graphics forum Jg. 30; H. 3; S. 1071 - 1080
Hauptverfasser:	Simonetto, Paolo, Archambault, Daniel, Auber, David, Bourqui, Romain
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford, UK Blackwell Publishing Ltd 01.06.2011 Wiley
Schriftenreihe:	IEEE Symposium on visualization 2011 (EuroVis 2011)
Schlagworte:	Algorithms Angular resolution Computation Computer graphics Computer programming Computer Science G.2.2 [Discrete Mathematics]: Graph Theory Graph Algorithms Graphs Image processing systems Links Other Preserving Smooth boundaries Studies
ISSN:	0167-7055, 1467-8659
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!