Results 231 to 240 of about 5,076 (252)
Some of the next articles are maybe not open access.
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 in Multi-attributed Graphs
2015Numerous information visualization techniques are available for utilizing and analyzing big data. Among which, network visualization that employs node-link diagrams can determine the relationship among multi-dimensional data. However, when data become extremely large, visualization becomes obscure because of visual clutter.
Takafumi Yamashita, Ryosuke Saga
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
Multilevel agglomerative edge bundling for visualizing large graphs
2011 IEEE Pacific Visualization Symposium, 2011Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundling is an effective technique for alleviating clutter and revealing high-level edge patterns.
Emden R. Gansner +3 more
openaire +1 more source
Swarm-Based Edge Bundling Applied to Flow Mapping
2017Applying flow maps in large datasets involves dealing with the reduction of visual cluttering. Nowadays, a technique known as edge bundling, which is geometric in nature, is often applied to reduce visual clutter and create meaningful traces that highlight the main streams of flow.
Evgheni Polisciuc, Penousal Machado
openaire +1 more source
Quantitative Evaluation for Edge Bundling by Difference of Edge Lengths and Area Occupation
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.
openaire +1 more source
Edge Bundling for Visualizing Communication Behavior
2016 Third Workshop on Visual Performance Analysis (VPA), 2016Ronny Brendel +4 more
openaire +1 more source