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...

Celý popis

Podrobná bibliografie

Vydáno v:	Computer graphics forum Ročník 30; číslo 3; s. 1071 - 1080
Hlavní autoři:	Simonetto, Paolo, Archambault, Daniel, Auber, David, Bourqui, Romain
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford, UK Blackwell Publishing Ltd 01.06.2011 Wiley
Edice:	IEEE Symposium on visualization 2011 (EuroVis 2011)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!