MLSEB

Edge bundling using moving least squares approximation

Jieting Wu, Jianping Zeng, Feiyu Zhu, Hongfeng Yu

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

Abstract

Edge bundling methods can effectively alleviate visual clutter and reveal high-level graph structures in large graph visualization. Researchers have devoted significant efforts to improve edge bundling according to different metrics. As the edge bundling family evolve rapidly, the quality of edge bundles receives increasing attention in the literature accordingly. In this paper, we present MLSEB, a novel method to generate edge bundles based on moving least squares (MLS) approximation. In comparison with previous edge bundling methods, we argue that our MLSEB approach can generate better results based on a quantitative metric of quality, and also ensure scalability and the efficiency for visualizing large graphs.

Original languageEnglish (US)
Title of host publicationGraph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers
EditorsKwan-Liu Ma, Fabrizio Frati
PublisherSpringer Verlag
Pages379-393
Number of pages15
ISBN (Print)9783319739144
DOIs
StatePublished - Jan 1 2018
Event25th International Symposium on Graph Drawing and Network Visualization, GD 2017 - Boston, United States
Duration: Sep 25 2017Sep 27 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10692 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other25th International Symposium on Graph Drawing and Network Visualization, GD 2017
CountryUnited States
CityBoston
Period9/25/179/27/17

Fingerprint

Least squares approximations
Moving Least-squares Approximation
Scalability
Visualization
Bundle
Graph in graph theory
Metric
Clutter

Keywords

  • Edge bundling
  • Graph visualization
  • Moving least squares
  • Visualization quality

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Wu, J., Zeng, J., Zhu, F., & Yu, H. (2018). MLSEB: Edge bundling using moving least squares approximation. In K-L. Ma, & F. Frati (Eds.), Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers (pp. 379-393). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10692 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-73915-1_30

MLSEB : Edge bundling using moving least squares approximation. / Wu, Jieting; Zeng, Jianping; Zhu, Feiyu; Yu, Hongfeng.

Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. ed. / Kwan-Liu Ma; Fabrizio Frati. Springer Verlag, 2018. p. 379-393 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10692 LNCS).

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

Wu, J, Zeng, J, Zhu, F & Yu, H 2018, MLSEB: Edge bundling using moving least squares approximation. in K-L Ma & F Frati (eds), Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10692 LNCS, Springer Verlag, pp. 379-393, 25th International Symposium on Graph Drawing and Network Visualization, GD 2017, Boston, United States, 9/25/17. https://doi.org/10.1007/978-3-319-73915-1_30
Wu J, Zeng J, Zhu F, Yu H. MLSEB: Edge bundling using moving least squares approximation. In Ma K-L, Frati F, editors, Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. Springer Verlag. 2018. p. 379-393. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-73915-1_30
Wu, Jieting ; Zeng, Jianping ; Zhu, Feiyu ; Yu, Hongfeng. / MLSEB : Edge bundling using moving least squares approximation. Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. editor / Kwan-Liu Ma ; Fabrizio Frati. Springer Verlag, 2018. pp. 379-393 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7a7edb9250294701b4f6d8e546c55c42,
title = "MLSEB: Edge bundling using moving least squares approximation",
abstract = "Edge bundling methods can effectively alleviate visual clutter and reveal high-level graph structures in large graph visualization. Researchers have devoted significant efforts to improve edge bundling according to different metrics. As the edge bundling family evolve rapidly, the quality of edge bundles receives increasing attention in the literature accordingly. In this paper, we present MLSEB, a novel method to generate edge bundles based on moving least squares (MLS) approximation. In comparison with previous edge bundling methods, we argue that our MLSEB approach can generate better results based on a quantitative metric of quality, and also ensure scalability and the efficiency for visualizing large graphs.",
keywords = "Edge bundling, Graph visualization, Moving least squares, Visualization quality",
author = "Jieting Wu and Jianping Zeng and Feiyu Zhu and Hongfeng Yu",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-73915-1_30",
language = "English (US)",
isbn = "9783319739144",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "379--393",
editor = "Kwan-Liu Ma and Fabrizio Frati",
booktitle = "Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers",

}

TY - GEN

T1 - MLSEB

T2 - Edge bundling using moving least squares approximation

AU - Wu, Jieting

AU - Zeng, Jianping

AU - Zhu, Feiyu

AU - Yu, Hongfeng

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Edge bundling methods can effectively alleviate visual clutter and reveal high-level graph structures in large graph visualization. Researchers have devoted significant efforts to improve edge bundling according to different metrics. As the edge bundling family evolve rapidly, the quality of edge bundles receives increasing attention in the literature accordingly. In this paper, we present MLSEB, a novel method to generate edge bundles based on moving least squares (MLS) approximation. In comparison with previous edge bundling methods, we argue that our MLSEB approach can generate better results based on a quantitative metric of quality, and also ensure scalability and the efficiency for visualizing large graphs.

AB - Edge bundling methods can effectively alleviate visual clutter and reveal high-level graph structures in large graph visualization. Researchers have devoted significant efforts to improve edge bundling according to different metrics. As the edge bundling family evolve rapidly, the quality of edge bundles receives increasing attention in the literature accordingly. In this paper, we present MLSEB, a novel method to generate edge bundles based on moving least squares (MLS) approximation. In comparison with previous edge bundling methods, we argue that our MLSEB approach can generate better results based on a quantitative metric of quality, and also ensure scalability and the efficiency for visualizing large graphs.

KW - Edge bundling

KW - Graph visualization

KW - Moving least squares

KW - Visualization quality

UR - http://www.scopus.com/inward/record.url?scp=85041836521&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85041836521&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-73915-1_30

DO - 10.1007/978-3-319-73915-1_30

M3 - Conference contribution

SN - 9783319739144

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 379

EP - 393

BT - Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers

A2 - Ma, Kwan-Liu

A2 - Frati, Fabrizio

PB - Springer Verlag

ER -