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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017 |
| Publisher | IEEE Computer Society |
| Pages | 358-365 |
| Number of pages | 8 |
| Volume | 2017-November |
| ISBN (Electronic) | 9781538638767 |
| DOIs | |
| Publication status | Published - 2018 Jun 4 |
| Event | 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017 - Boston, United States Duration: 2017 Nov 6 → 2017 Nov 8 |
Other
| Other | 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017 |
|---|---|
| Country | United States |
| City | Boston |
| Period | 17/11/6 → 17/11/8 |
Fingerprint
Keywords
- Graph bundling
- Minimal trees
- Path planning
- Polygonal maps
ASJC Scopus subject areas
- Software
- Artificial Intelligence
- Computer Science Applications
Cite this
Bundling n-stars in polygonal maps. / Parque Tenorio, Victor; Miyashita, Tomoyuki.
Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017. Vol. 2017-November IEEE Computer Society, 2018. p. 358-365.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Bundling n-stars in polygonal maps
AU - Parque Tenorio, Victor
AU - Miyashita, Tomoyuki
PY - 2018/6/4
Y1 - 2018/6/4
N2 - 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.
AB - 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.
KW - Graph bundling
KW - Minimal trees
KW - Path planning
KW - Polygonal maps
UR - http://www.scopus.com/inward/record.url?scp=85048471572&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85048471572&partnerID=8YFLogxK
U2 - 10.1109/ICTAI.2017.00063
DO - 10.1109/ICTAI.2017.00063
M3 - Conference contribution
AN - SCOPUS:85048471572
VL - 2017-November
SP - 358
EP - 365
BT - Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017
PB - IEEE Computer Society
ER -