Skip to Main content Skip to Navigation
Journal articles

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

Paolo Simonetto 1, 2 Daniel Archambault 3 David Auber 1, 2 Romain Bourqui 1, 2 
2 GRAVITE - Graph Visualization and Interactive Exploration
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : PrEd 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-like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overly-restrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEd proves to be consistently faster than PrEd.
Document type :
Journal articles
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Paolo Simonetto Connect in order to contact the contributor
Submitted on : Monday, August 8, 2011 - 7:20:05 PM
Last modification on : Saturday, June 25, 2022 - 8:30:01 PM
Long-term archiving on: : Thursday, March 30, 2017 - 12:41:15 PM


Files produced by the author(s)


  • HAL Id : inria-00605921, version 1



Paolo Simonetto, Daniel Archambault, David Auber, Romain Bourqui. ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges. Computer Graphics Forum, Wiley, 2011, IEEE Symposium on visualization 2011 (EuroVis 2011), 30 (3). ⟨inria-00605921⟩



Record views


Files downloads