Bundling n-stars in polygonal maps

    研究成果: Conference contribution

    1 引用 (Scopus)

    抜粋

    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.

    元の言語English
    ホスト出版物のタイトルProceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017
    出版者IEEE Computer Society
    ページ358-365
    ページ数8
    2017-November
    ISBN(電子版)9781538638767
    DOI
    出版物ステータスPublished - 2018 6 4
    イベント29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017 - Boston, United States
    継続期間: 2017 11 62017 11 8

    Other

    Other29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017
    United States
    Boston
    期間17/11/617/11/8

    ASJC Scopus subject areas

    • Software
    • Artificial Intelligence
    • Computer Science Applications

    フィンガープリント Bundling n-stars in polygonal maps' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Parque Tenorio, V., & Miyashita, T. (2018). Bundling n-stars in polygonal maps. : Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017 (巻 2017-November, pp. 358-365). IEEE Computer Society. https://doi.org/10.1109/ICTAI.2017.00063