Browsing by Subject "G.2.2 [Discrete Mathematics]"

Now showing items 1-2 of 2

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

      Simonetto, Paolo; Archambault, Daniel; Auber, David; Bourqui, Romain (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 ...

    • A Novel Radial Visualization Approach for Undirected Hypergraphs 

      Kerren, Andreas; Jusufi, Ilir (The Eurographics Association, 2013)
      Hypergraphs are a more generalized concept of graphs where an edge typically connects multiple vertices. They are applicable to many different domains such as the representation of complex biochemical pathways or classification ...