Optimal Orthogonal Drawings in Linear Time

TL;DR

This paper introduces a linear-time algorithm for creating optimal orthogonal drawings of 3-graphs, minimizing bends and curve complexity, and works in the variable embedding setting.

Contribution

It provides the first linear-time algorithm for simultaneously minimizing bends and curve complexity in orthogonal drawings of 3-graphs in variable embedding settings.

Findings

Algorithm runs in linear time.

Minimizes total bends and curve complexity.

Works for graphs with maximum degree three.

Abstract

A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and no two edges intersect except at common end-points. A bend of {\Gamma} is a point of an edge where a horizontal and a vertical segment meet. Drawing {\Gamma} is bend-minimum if it has the minimum number of bends over all possible planar orthogonal drawings of G. Its curve complexity is the maximum number of bends per edge. In this paper we present a linear-time algorithm for the computation of planar orthogonal drawings of 3-graphs (i.e., graphs with vertex-degree at most three), that minimizes both the total number of bends and the curve complexity. The algorithm works in the so-called variable embedding setting, that is, it can choose among the exponentially many planar embeddings of the input graph. While the time complexity of minimizing the total number of bends of a planar orthogonal drawing of a 3-graph in the variable embedding settings is a long standing, widely studied, open question, the existence of an orthogonal drawing that is optimal both in the total number of bends and in the curve complexity was previously unknown. Our result combines several graph decomposition techniques, novel data-structures, and efficient approaches to re-rooting decomposition trees.