Article ID: | iaor201526353 |
Volume: | 72 |
Issue: | 2 |
Start Page Number: | 656 |
End Page Number: | 685 |
Publication Date: | Jun 2015 |
Journal: | Algorithmica |
Authors: | Buchin Kevin, Speckmann Bettina, Verbeek Kevin |
Keywords: | networks: flow, programming: dynamic |
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