Bundling n-stars in polygonal maps

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

    1 Citation (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
    Volume2017-November
    ISBN (Electronic)9781538638767
    DOIs
    Publication statusPublished - 2018 Jun 4
    Event29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017 - Boston, United States
    Duration: 2017 Nov 62017 Nov 8

    Other

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

    Fingerprint

    Stars
    Experiments

    Keywords

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

    ASJC Scopus subject areas

    • Software
    • Artificial Intelligence
    • Computer Science Applications

    Cite this

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

    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 proceedingConference contribution

    Parque Tenorio, V & Miyashita, T 2018, Bundling n-stars in polygonal maps. in Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017. vol. 2017-November, IEEE Computer Society, pp. 358-365, 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017, Boston, United States, 17/11/6. https://doi.org/10.1109/ICTAI.2017.00063
    Parque Tenorio V, Miyashita T. Bundling n-stars in polygonal maps. In Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017. Vol. 2017-November. IEEE Computer Society. 2018. p. 358-365 https://doi.org/10.1109/ICTAI.2017.00063
    Parque Tenorio, Victor ; Miyashita, Tomoyuki. / Bundling n-stars in polygonal maps. Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017. Vol. 2017-November IEEE Computer Society, 2018. pp. 358-365
    @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 = "{Parque Tenorio}, Victor and Tomoyuki Miyashita",
    year = "2018",
    month = "6",
    day = "4",
    doi = "10.1109/ICTAI.2017.00063",
    language = "English",
    volume = "2017-November",
    pages = "358--365",
    booktitle = "Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017",
    publisher = "IEEE Computer Society",

    }

    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

    VL - 2017-November

    SP - 358

    EP - 365

    BT - Proceedings - 2017 International Conference on Tools with Artificial Intelligence, ICTAI 2017

    PB - IEEE Computer Society

    ER -