MLSEB: Edge Bundling Using Moving Least Squares Approximation

DOI10.1007/978-3-319-73915-1_30zbMath1503.68237arXiv1709.01221OpenAlexW2964030233MaRDI QIDQ4625129

Jieting Wu, Feiyu Zhu, Hongfeng Yu, Jianping Zeng

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.01221

zbMATH Keywords

moving least squaresedge bundlinggraph visualizationvisualization quality

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Curve reconstruction from unorganized points
• Are Crossings Important for Drawing Large Graphs?
• Improving Layered Graph Layouts with Edge Bundling
• TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance
• Improved Circular Layouts
• Surfaces Generated by Moving Least Squares Methods
• StreamEB: Stream Edge Bundling.

This page was built for publication: MLSEB: Edge Bundling Using Moving Least Squares Approximation