![]() Our method is based on so-called spiral trees, a novel type of Steiner tree which uses logarithmic spirals. We present a new algorithmic method that uses edge-bundling and computes crossing-free flows of high visual quality. ![]() Some of the known algorithms do not support edgebundling and those that do, cannot guarantee crossing-free flows. Most flow maps are still drawn by hand and only few automated methods exist. Good flow maps reduce visual clutter by merging (bundling) lines smoothly and by avoiding self-intersections. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of flow between a source and a target. We demonstrate our approach with extensive experiments.ĪB - Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. ![]() Our flows can also avoid obstacles, such as map features, region outlines, or even the targets. Spiral trees naturally induce a clustering on the targets and smoothly bundle lines. N2 - Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. We demonstrate our approach with extensive experiments.", ![]() We demonstrate our approach with extensive experiments.Ībstract = "Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |