Angle-restricted Steiner arborescences for flow map layout

Research output: Contribution to journalArticleAcademicpeer-review

10 Citations (Scopus)
328 Downloads (Pure)

Abstract

We introduce a new variant of the geometric Steiner arborescence problem, motivated by the layout of flow maps. Flow maps show the movement of objects between places. They reduce visual clutter by bundling curves smoothly and avoiding self-intersections. To capture these properties, our angle-restricted Steiner arborescences, or flux trees, connect several targets to a source with a tree of minimal length whose arcs obey a certain restriction on the angle they form with the source. We study the properties of optimal flux trees and show that they are crossing-free and consist of logarithmic spirals and straight lines. Flux trees have the shallow-light property. We show that computing optimal flux trees is NP-hard. Hence we consider a variant of flux trees which uses only logarithmic spirals. Spiral trees approximate flux trees within a factor depending on the angle restriction. Computing optimal spiral trees remains NP-hard, but we present an efficient 2-approximation, which can be extended to avoid "positive monotone" obstacles. Keywords: Steiner arborescences; Flow maps; Computational geometry; Automated cartography
Original languageEnglish
Pages (from-to)656-685
Number of pages30
JournalAlgorithmica
Volume72
Issue number2
DOIs
Publication statusPublished - 2015

Fingerprint

Dive into the research topics of 'Angle-restricted Steiner arborescences for flow map layout'. Together they form a unique fingerprint.

Cite this