Achieving Good Angular Resolution in 3D Arc Diagrams

TL;DR

This paper introduces algorithms for creating 3D arc diagrams with good angular resolution, even when constrained by a given 2D layout, using novel coloring techniques.

Contribution

It presents new algorithms for 3D arc diagram visualization that ensure good angular resolution and introduces a new localized edge coloring problem.

Findings

Algorithms achieve good angular resolution in 3D arc diagrams.

Methods work with constraints from 2D straight-line drawings.

New localized edge coloring algorithm is proposed.

Abstract

We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3D arc diagrams, even for cases when the arcs must project to a given 2D straight-line drawing of the input graph. Our methods make use of various graph coloring algorithms, including an algorithm for a new coloring problem, which we call localized edge coloring.