Results 161 to 170 of about 206 (191)
Some of the next articles are maybe not open access.
Research on Network Simplification by Edge Bundling
2016 IEEE First International Conference on Data Science in Cyberspace (DSC), 2016Node occlusion and edge congestion problems, which are caused by the increasing scale and complexity of network, had become a hot spot in network visualization research. To solve the visual clutter problem in network, edges close to each other in network were bundled by curving them.
Zhonghua Yao, Lingda Wu
openaire +1 more source
Quantitative Evaluation for Edge Bundling by Difference of Edge Lengths and Area Occupation
Communications in Computer and Information Science, 2016There are a lot of information visualization techniques to utilize and analyze big data. Network visualization as node-link diagrams is one of techniques, which can visualize the relationship of multidimensional data, but when the data become very large, the visualization becomes obscure because of visual clutter.
Ryosuke Saga, Saga Ryosuke
exaly +2 more sources
An Edge-Bundling Layout for Interactive Parallel Coordinates
2014 IEEE Pacific Visualization Symposium, 2014Parallel Coordinates is an often used visualization method for multidimensional data sets. Its main challenges for large data sets are visual clutter and over plotting which hamper the recognition of patterns in the data. We present an edge-bundling method using density-based clustering for each dimension.
Gregorio Palmas +4 more
openaire +2 more sources
A Distributed Algorithm for Force Directed Edge Bundling
2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV), 2020Existing edge bundling algorithms typically require the global information structure of a graph. Therefore, with a simple division of the edges of a graph, it is challenging to conduct edge bundling in a distributed environment and achieve scalable performance. We select a representative edge bundling algorithm, Force-Directed Edge Bundling (FDEB), and
Hongfeng Yu
exaly +2 more sources
Force‐Directed Edge Bundling for Graph Visualization
Computer Graphics Forum, 2009AbstractGraphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high‐level edge patterns. Previous methods require the graph to contain a hierarchy for this,
Holten, D.H.R., Wijk, van, J.J.
openaire +2 more sources
Asymptotically Optimal Kinodynamic Planning Using Bundles of Edges
2021 IEEE International Conference on Robotics and Automation (ICRA), 2021Using sampling to estimate the connectivity of high-dimensional configuration spaces has been the theoretical underpinning for effective sampling-based motion planners. Typical strategies either build a roadmap, or a tree as the underlying search structure that connects sampled configurations, with a focus on guaranteeing completeness and optimality as
Rahul Shome, Lydia E. Kavraki
openaire +1 more source
Edge Bundling by Rapidly-Exploring Random Trees
2013 17th International Conference on Information Visualisation, 2013We introduce a technique for bundling edges in graphs where a hierarchical organization of the vertices is not available. Instead of applying time-complex force-directed edge bundling, we adopt the concept of Rapidly-Exploring Random Trees (RRTs). We use RRTs for fast computation of a hierarchical space organization that is independent of the spatial ...
Michael Burch +2 more
openaire +1 more source
Interactive 3D Force‐Directed Edge Bundling
Computer Graphics Forum, 2016AbstractInteractive analysis of 3D relational data is challenging. A common way of representing such data are node‐link diagrams as they support analysts in achieving a mental model of the data. However, naïve 3D depictions of complex graphs tend to be visually cluttered, even more than in a 2D layout.
Daniel Zielasko +3 more
openaire +1 more source
CactusTree: A tree drawing approach for hierarchical edge bundling
2017 IEEE Pacific Visualization Symposium (PacificVis), 2017This paper introduces CactusTree, a novel visualization technique for representing hierarchical datasets. We introduce details about the construction of CactusTrees and describe how they can be used to represent nested data and relationships between elements in the data.
Tommy Dang, Angus G. Forbes
openaire +1 more source
Visualizing large graphs by layering and bundling graph edges
The Visual Computer, 2018Edge bundling has been widely used to reduce visual clutter and reveal high-level edge patterns for large graphs. Due to strong edge attraction, bundled results often show unnecessary curvature and tangling at bundle intersections. Inappropriate bundling may fail to reveal true data patterns and even mislead users. This paper presents a parameterizable
Zhuang Cai, Kang Zhang 0001, Dong-Ni Hu
openaire +1 more source