Results 11 to 20 of about 258,118 (263)
-shaped point set embeddings of high-degree plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
Uncertainty Visualization: Concepts, Methods, and Applications in Biological Data Visualization
Frontiers in Bioinformatics, 2022 This paper provides an overview of uncertainty visualization in general, along with specific examples of applications in bioinformatics. Starting from a processing and interaction pipeline of visualization, components are discussed that are relevant for ...
Daniel Weiskopf
doaj +1 more source
Applied Network Science, 2023 Hypergraph is a graph structure that can efficiently express the relationship of multiple nodes and has attracted attention in recent years. As with normal graphs, the structure changes every moment, and it is an important research topic in graph mining ...
Shuta Ito, Takayasu Fushimi
doaj +1 more source
Similarity-Driven Edge Bundling: Data-Oriented Clutter Reduction in Graphs Layouts
Algorithms, 2020 Graph visualization has been successfully applied in a wide range of problems and applications. Although different approaches are available to create visual representations, most of them suffer from clutter when faced with many nodes and/or edges.
Fabio Sikansi +4 more
doaj +1 more source
CoRR, 2017 In this study, we formulate the concept of "mining maximal-size frequent subgraphs" in the challenging domain of visual data (images and videos). In general, visual knowledge can usually be modeled as attributed relational graphs (ARGs) with local attributes representing local parts and pairwise attributes describing the spatial relationship between ...
Quanshi Zhang +2 more
openaire +3 more sources
Interactive visualization of genealogical graphs [PDF]
IEEE Symposium on Information Visualization, 2005. INFOVIS 2005., 2005 The general problem of visualizing "family trees", or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs can be difficult to draw. This motivates some novel graphical representations, including one based on a dual tree, a subgraph formed by the union of two trees.
Michael J. McGuffin, Ravin Balakrishnan
openaire +1 more source
Advanced Science, 2022 Topological phases of matter are conventionally characterized by the bulk‐boundary correspondence in Hermitian systems. The topological invariant of the bulk in d dimensions corresponds to the number of (d − 1)‐dimensional boundary states.
Ce Shang +13 more
doaj +1 more source
IEEE Access, 2019 This paper proposes new techniques in a visualization-enabled graph data quality assessment and alignment system leveraging feedback-driven provenance with goal of improving scalability, reducing execution time, and increasing relevance.
Kuldeep Reddy
doaj +1 more source
The State of the Art in Empirical User Evaluation of Graph Visualizations
IEEE Access, 2021 While graph drawing focuses more on the aesthetic representation of node-link diagrams, graph visualization takes into account other visual metaphors making them useful for graph exploration tasks in information visualization and visual analytics ...
Michael Burch +5 more
doaj +1 more source
Visualizing weighted edges in graphs [PDF]
Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003., 2004 This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility.
Peter Rodgers 0001, Paul Mutton
openaire +1 more source