Layered Drawing of Undirected Graphs with Generalized Port Constraints

TL;DR

This paper presents a practical method for automatically drawing complex cable plans with port constraints by extending the Sugiyama framework, improving readability and reducing crossings in the resulting diagrams.

Contribution

It introduces a novel extension of the Sugiyama framework to handle port groups in undirected graphs, with experimental comparison to existing methods.

Findings

10-30% fewer crossings than Kieler

Comparable bend counts and computation time

Effective on real-world and synthetic data

Abstract

The aim of this research is a practical method to draw cable plans of complex machines. Such plans consist of electronic components and cables connecting specific ports of the components. Since the machines are configured for each client individually, cable plans need to be drawn automatically. The drawings must be well readable so that technicians can use them to debug the machines. In order to model plug sockets, we introduce port groups; within a group, ports can change their position (which we use to improve the aesthetics of the layout), but together the ports of a group must form a contiguous block. We approach the problem of drawing such cable plans by extending the well-known Sugiyama framework such that it incorporates ports and port groups. Since the framework assumes directed graphs, we propose several ways to orient the edges of the given undirected graph. We compare these methods experimentally, both on real-world data and synthetic data that carefully simulates real-world data. We measure the aesthetics of the resulting drawings by counting bends and crossings. Using these metrics, we experimentally compare our approach to Kieler [JVLC 2014], a library for drawing graphs in the presence of port constraints. Our method produced 10--30 % fewer crossings, while it performed equally well or slightly worse than Kieler with respect to the number of bends and the time used to compute a drawing.