Force-Directed Layout of Order Diagrams using Dimensional Reduction

02/04/2021
by   Dominik Dürrschnabel, et al.
0

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 two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one optimizes on distances of nodes and the other on distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2019

Drawing Order Diagrams Through Two-Dimension Extension

Order diagrams are an important tool to visualize the complex structure ...
research
12/15/2017

Driving Interactive Graph Exploration Using 0-Dimensional Persistent Homology Features

Graphs are commonly used to encode relationships among entities, yet, th...
research
11/03/2017

A Fast Successive Over-Relaxation Algorithm for Force-Directed Network Graph Drawing

Force-directed approach is one of the most widely used methods in graph ...
research
11/08/2017

An Application of Mosaic Diagrams to the Visualization of Set Relationships

We present an application of mosaic diagrams to the visualisation of set...
research
09/27/2021

The edge labeling of higher order Voronoi diagrams

We present an edge labeling of order-k Voronoi diagrams, V_k(S), of poin...
research
06/30/2019

Automatic Routing of Goldstone Diagrams using Genetic Algorithms

This paper presents an algorithm for an automatic transformation (=routi...
research
01/30/2019

Decreasing Diagrams for Confluence and Commutation

The decreasing diagrams technique is one of the strongest and most versa...

Please sign up or login with your details

Forgot password? Click here to reset