Angle-Restricted Steiner Arborescences for Flow Map Layout
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-restri...
|Published in:||Algorithmica : an international journal in computer science, Vol. 72, No. 2 (2015), p. 656-685|
|Other Involved Persons:||;|
|Item Description:||A preliminary version of this paper appeared in the Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 250–259, Lecture Notes in Computer Science 7074, 2011. B. Speckmann and K. Verbeek were supported by the Netherlands Organization for Scientific Research (NWO) under project no. 639.022.707.|
|QR Code:||Show QR Code|