Bundling n-stars in polygonal maps

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017
PublisherIEEE Computer Society
Pages358-365
Number of pages8
ISBN (Electronic)9781538638767
DOIs
Publication statusPublished - 2017 Jul 2
Event29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017 - Boston, United States
Duration: 2017 Nov 62017 Nov 8

Publication series

NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
Volume2017-November
ISSN (Print)1082-3409

Other

Other29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017
Country/TerritoryUnited States
CityBoston
Period17/11/617/11/8

Keywords

  • Graph bundling
  • Minimal trees
  • Path planning
  • Polygonal maps

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Bundling n-stars in polygonal maps'. Together they form a unique fingerprint.

Cite this