Angle-Restricted Steiner Arborescences for Flow Map Layout
Preprint
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.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Flow Map Layout via Spiral TreesIEEE Transactions on Visualization and Computer Graphics, 2011
- Visualisation of Origins, Destinations and Flows with OD MapsThe Cartographic Journal, 2010
- Flow Mapping and Multivariate Visualization of Large Spatial Interaction DataIEEE Transactions on Visualization and Computer Graphics, 2009
- Network optimization for the design of underground minesNetworks, 2006
- The Rectilinear Steiner Arborescence Problem Is NP-CompleteSIAM Journal on Computing, 2005
- New approximations for the rectilinear steiner arborescence problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003
- Gradient-constrained minimum networks. I. FundamentalsJournal of Global Optimization, 2001
- Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence ProblemJournal of Combinatorial Optimization, 2000
- L 1 shortest paths among polygonal obstacles in the planeAlgorithmica, 1992
- The rectilinear steiner arborescence problemAlgorithmica, 1992