Angle-Restricted Steiner Arborescences for Flow Map Layout
From MaRDI portal
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 lines 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 planar 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.
Recommendations
- Angle-restricted Steiner arborescences for flow map layout
- Steiner trees for fixed orientation metrics
- A flow-dependent quadratic Steiner tree problem in the Euclidean plane
- The rectilinear Steiner arborescence problem
- Algorithms and Computation
- Flexibility of Steiner trees in uniform orientation metrics
- Using multiflow formulations to solve the Steiner tree problem in graphs
- Steiner Trees for Terminals Constrained to Curves
- The Steiner tree problem in orientation metrics
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
Cited in
(2)
This page was built for publication: Angle-Restricted Steiner Arborescences for Flow Map Layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104619)
