Force-Directed Layout of Order Diagrams using Dimensional Reduction

  title={Force-Directed Layout of Order Diagrams using Dimensional Reduction},
  author={Dominik D{\"u}rrschnabel and Gerd Stumme},
Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an experienced expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a… 


Drawing Order Diagrams Through Two-Dimension Extension
This work presents the novel algorithm DimDraw, based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph, to draw order diagrams.
An FDP-Algorithm for Drawing Lattices
An algorithm for drawing line diagrams of lattices based on force directed placement based on attribute additive diagrams since forces act on V -irreducibles only is discussed.
Methods for Visual Understanding of Hierarchical System Structures
Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods that determine the positions of vertices in two steps to improve the readability of drawings.
Planar Graph Drawing
It is proven that the modified algorithm still produces a straight-line grid drawing of the graph in linear time with an area bound quadratic in the sum of vertex weights, and that edges do not cross the drawings of other vertices’ representations.
Automated Lattice Drawing
This work has shown that lattices can be created by software, and it is important to have software that can automatically draw them.
Graph drawing by force‐directed placement
A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
A Greedy Heuristic for Crossing-Angle Maximization
A simple heuristic to compute a drawing with a large crossing angle is proposed and is accompanied by a speed-up technique to compute the crossing angle of a straight-line drawing.
Efficient Planarity Testing
An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.
Drawing series parallel digraphs symmetrically
Computing and visualizing concept lattices
In this thesis, a new algorithm called Grail computing concept lattices is developed and an experimental comparison with existing approaches is conducted and a family of algorithms using BDDs is developed that are shown to have better performance for the cases that are hard for algorithms using explicit representation.