Obstacle-Avoiding Euclidean Steiner Trees by n-Star Bundles

Optimal topologies in networked systems is of relevant interest to integrate and coordinate multi-agency. Our interest in this paper is to compute the root location and the topology of minimal-length tree layouts given n nodes in a polygonal map, assuming an n-star network topology. Computational experiments involving 600 minimal tree planning scenarios show the feasibility and efficiency of the proposed approach.

[1]  Jens Nielsen,et al.  Short trees in polygons , 2002, Discret. Appl. Math..

[2]  Emden R. GansnerYifan.  Multilevel Agglomerative Edge Bundling for Visualizing Large Graphs , 2011 .

[3]  Tomoyuki Miyashita,et al.  Towards bundling minimal trees in polygonal maps , 2018, GECCO.

[4]  Jarke J. van Wijk,et al.  Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.

[5]  Tomoyuki Miyashita,et al.  Route bundling in polygonal domains using Differential Evolution , 2017, Robotics and biomimetics.

[6]  R. Courant,et al.  What Is Mathematics , 1943 .

[7]  Yu Hu,et al.  A full-scale solution to the rectilinear obstacle-avoiding Steiner problem , 2008, Integr..

[8]  Hong Zhou,et al.  Geometry-Based Edge Clustering for Graph Visualization , 2008, IEEE Transactions on Visualization and Computer Graphics.

[9]  Tomoyuki Miyashita,et al.  Path Planning on Hierarchical Bundles with Differential Evolution , 2018, ICSI.

[10]  Matthias Müller-Hannemann,et al.  A near linear time approximation scheme for Steiner tree among obstacles in the plane , 2010, Comput. Geom..

[11]  Pawel Winter,et al.  Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs , 1993, Discret. Appl. Math..

[12]  Tomoyuki Miyashita,et al.  Optimization of route bundling via differential evolution with a convex representation , 2017, 2017 IEEE International Conference on Real-time Computing and Robotics (RCAR).

[13]  Jeffrey Heer,et al.  Divided Edge Bundling for Directional Network Data , 2011, IEEE Transactions on Visualization and Computer Graphics.

[14]  Liang Li,et al.  Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach , 2014, Integr..

[15]  Tomoyuki Miyashita,et al.  Bundling n-Stars in Polygonal Maps , 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

[16]  Wenzhong Guo,et al.  A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstacles , 2016, Integr..

[17]  Christophe Hurter,et al.  Graph Bundling by Kernel Density Estimation , 2012, Comput. Graph. Forum.

[18]  Danny Holten,et al.  Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.