# Drawing Order Diagrams Through Two-Dimension Extension

## TL;DR

This paper introduces DimDraw, a novel algorithm for drawing order diagrams that leverages the relationship between the dimension of an ordered set and the bipartiteness of an associated graph, improving readability.

## Contribution

The paper presents a new algorithm, DimDraw, which utilizes a relation between ordered set dimension and graph bipartiteness to generate clearer order diagrams.

## Key findings

- DimDraw produces more readable order diagrams.
- The algorithm effectively handles complex ordered sets.
- It outperforms classical graph drawing methods for order diagrams.

## Abstract

Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.