Obstacle-Avoiding Euclidean Steiner Trees by n-Star Bundles
Victor Parque, Tomoyuki Miyashita · 2018
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.