@inproceedings{ac14bf3e37c247e18e3a6cd8010a269d,
title = "Bundling n-stars in polygonal maps",
abstract = "This paper aims at computing minimal-length tree layouts given an n-star graph in a polygonal map. This problem is strongly related to the edge bundling problem, which consists of compounding the edges of an input graph to obtain topologically compact graph layouts being free of clutter and easy to visualize. Computational experiments using a diverse set of polygonal maps and number of edges in the input graph shows the feasibility, efficiency and robustness of our approach.",
keywords = "Graph bundling, Minimal trees, Path planning, Polygonal maps",
author = "Victor Parque and Tomoyuki Miyashita",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017 ; Conference date: 06-11-2017 Through 08-11-2017",
year = "2018",
month = jun,
day = "4",
doi = "10.1109/ICTAI.2017.00063",
language = "English",
series = "Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI",
publisher = "IEEE Computer Society",
pages = "358--365",
booktitle = "Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017",
}