检索结果-内蒙古大学图书馆

graph visualization efficiency of popular web-based libraries

Visual Computing for Industry, Biomedicine, and Art 2025年第1期8卷 1-17页

作者： Zhao, Xin Wang, Xuan Zou, Xianzhe Liang, Huiming Bai, Genghuai Zhang, Ning Huang, Xin Zhou, Fangfang Zhao, Ying School of Computer Science and Engineering Central South University Changsha China QAX Security Center Qi An Xin Technology Group Inc. Beijing China

Web-based libraries, such as ***, ***, and ***, are widely used to generate node-link graph visualizations. These libraries allow users to call application programming interfaces (APIs) without identifying the details of the encapsulated techniques such as graph layout algorithms and graph rendering methods. Efficiency requirements, such as visualizing a graph with 3k nodes and 4k edges within 1 min at a frame rate of 30 fps, are crucial for selecting a proper library because libraries generally present different characteristics owing to the diversity of encapsulated techniques. However, existing studies have mainly focused on verifying the advantages of a new layout algorithm or rendering method from a theoretical viewpoint independent of specific web-based libraries. Their conclusions are difficult for end users to understand and utilize. Therefore, a trial-and-error selection process is required. This study addresses this gap by conducting an empirical experiment to evaluate the performance of web-based libraries. The experiment involves popular libraries and hundreds of graph datasets covering node scales from 100 to 200k and edge-to-node ratios from 1 to 10 (including complete graphs). The experimental results are the time costs and frame rates recorded using the libraries to visualize the datasets. The authors analyze the performance characteristics of each library in depth based on the results and organize the results and findings into application-oriented guidelines. Additionally, they present three usage cases to illustrate how the guidelines can be applied in practice. These guidelines offer user-friendly and reliable recommendations, aiding users in quickly selecting the desired web-based libraries based on their specific efficiency requirements for node-link graph visualizations.

关键词： graph visualization Node-link diagram visualization library Web-based visualization

来源：评论

学校读者我要写书评

暂无评论

graph visualization and navigation in information visualization:: A survey

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER graphICS 2000年第1期6卷 24-43页

作者： Herman, I Melançon, G Marshall, MS CWI Ctr Math & Comp Sci NL-1090 GB Amsterdam Netherlands

This is a survey on graph visualization and navigation techniques. as used in information visualization. graphs appear in numerous applications such as web browsing, state-transition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application, information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective.

关键词： information visualization graph visualization graph drawing navigation focus plus context fish-eye clustering

来源：评论

学校读者我要写书评

暂无评论

graph visualization for the analysis of the structure and dynamics of extreme-scale supercomputers

引用

Information visualization 1997年第3期3卷 209-222页

作者： Summers, Kenneth L. Caudell, Thomas Preston Berkbigler, Kathryn Bush, Brian Davis, Kei Smith, Steve Center for High Performance Computing University of New Mexico Albuquerque NM United States Department of Electrical & Computer Engineering University of New Mexico Albuquerque NM United States Los Alamos National Laboratory Los Alamos NM United States

We are exploring the development and application of information visualization techniques for the analysis of new massively parallel supercomputer architectures. Modern supercomputers typically comprise very large clusters of commodity SMPs interconnected by possibly dense and often non-standard networks. The scale, complexity, and inherent non-locality of the structure and dynamics of this hardware, and the operating systems and applications distributed over them, challenge traditional analysis methods. As part of the á la carte (A Los Alamos Computer Architecture Toolkit for Extreme-Scale Architecture Simulation) team at Los Alamos National Laboratory, who are simulating these new architectures, we are exploring advanced visualization techniques and creating tools to enhance analysis of these simulations with intuitive three-dimensional representations and interfaces. This work complements existing and emerging algorithmic analysis tools. In this paper, we give background on the problem domain, a description of a prototypical computer architecture of interest (on the order of 10,000 processors connected by a quaternary fat-tree communications network), and a presentation of three classes of visualizations that clearly display the switching fabric and the flow of information in the interconnecting network. © 2004, SAGE Publications. All rights reserved.

关键词： graph visualization scalable representations virtual environments

来源：评论

学校读者我要写书评

暂无评论

An object-oriented design for graph visualization

引用

SOFTWARE-PRACTICE & EXPERIENCE 2001年第8期31卷 739-756页

作者： Marshall, MS Herman, I Melançon, G CWI Ctr Math & Comp Sci NL-1090 GB Amsterdam Netherlands

Many applications, from everyday file system browsers to visual programming tools, require the display of network and graph structures. The graph visualization Framework (GVF) (available at http://***/InfoVisu/GVF) is an architecture that supports the tasks common to most graph browsers and editors. This article gives a brief overview of the design of the GVF and focuses on the core classes that are used to represent and manipulate graphs, The design of the core classes is justified by the requirements for navigation and visualization. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： graph visualization information visualization networks data structure framework software libraries

来源：评论

学校读者我要写书评

暂无评论

Stereoscopic Highlighting: 2D graph visualization on Stereo Displays

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER graphICS 2011年第12期17卷 2325-2333页

作者： Alper, Basak Hoellerer, Tobias Kuchera-Morin, JoAnn Forbes, Angus Univ Calif Santa Barbara Media Arts & Technol Program Santa Barbara CA 93106 USA Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

In this paper we present a new technique and prototype graph visualization system, stereoscopic highlighting, to help answer accessibility and adjacency queries when interacting with a node-link diagram. Our technique utilizes stereoscopic depth to highlight regions of interest in a 2D graph by projecting these parts onto a plane closer to the viewpoint of the user. This technique aims to isolate and magnify specific portions of the graph that need to be explored in detail without resorting to other highlighting techniques like color or motion, which can then be reserved to encode other data attributes. This mechanism of stereoscopic highlighting also enables focus+context views by juxtaposing a detailed image of a region of interest with the overall graph, which is visualized at a further depth with correspondingly less detail. In order to validate our technique, we ran a controlled experiment with 16 subjects comparing static visual highlighting to stereoscopic highlighting on 2D and 3D graph layouts for a range of tasks. Our results show that while for most tasks the difference in performance between stereoscopic highlighting alone and static visual highlighting is not statistically significant, users performed better when both highlighting methods were used concurrently. In more complicated tasks, 3D layout with static visual highlighting outperformed 2D layouts with a single highlighting method. However, it did not outperform the 2D layout utilizing both highlighting techniques simultaneously. Based on these results, we conclude that stereoscopic highlighting is a promising technique that can significantly enhance graph visualizations for certain use cases.

关键词： graph visualization stereo displays virtual reality

来源：评论

学校读者我要写书评

暂无评论

Design and Evaluation of MagnetViz-A graph visualization Tool

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER graphICS 2012年第5期18卷 822-835页

作者： Spritzer, Andre Suslik Dal Sasso Freitas, Carla Maria Univ Fed Rio Grande do Sul BR-90450170 Porto Alegre RS Brazil Univ Fed Rio Grande do Sul UFRGS Inst Informat BR-91501970 Porto Alegre RS Brazil

MagnetViz was designed for the interactive manipulation of force-directed graph layouts, allowing the user to obtain visualizations based on the graph topology and/or the attributes of its nodes and edges. The user can introduce virtual magnets anywhere in the graph and these can be set to attract nodes and edges that fulfill user-defined criteria. When a magnet is placed, the force-directed nature of the layout forces it to reorganize itself in order to reflect the changes in the balance of forces, consequently changing the visualization into one that is more semantically relevant to the user. This paper describes MagnetViz's concepts, illustrating them with examples and a case study based on a usage scenario. We also describe how the MagnetViz has evolved since its original version and present the evaluation of its latest version. This evaluation consists of two user studies aiming at assessing generated layout quality and how well the concepts can be apprehended and employed, and a task taxonomy assessment focusing on establishing which graph visualization tasks the technique is able to handle.

关键词： graph visualization force-directed layout evaluation social networks visualization

来源：评论

学校读者我要写书评

暂无评论

What Would a graph Look Like in This Layout? A Machine Learning Approach to Large graph visualization

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER graphICS 2018年第1期24卷 478-488页

作者： Kwon, Oh-Hyun Crnovrsanin, Tarik Ma, Kwan-Liu Univ Calif Davis Davis CA 95616 USA

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

关键词： graph visualization graph layout aesthetics machine learning graph kernel graphlet

来源：评论

学校读者我要写书评

暂无评论

On labeling in graph visualization

引用

INFORMATION SCIENCES 2007年第12期177卷 2459-2472页

作者： Dogrusoz, Ugur Kakoulis, Konstantinos G. Madden, Brendan Tollis, Ioannis G. Bilkent Univ Dept Comp Engn TR-06800 Ankara Turkey Tom Sawyer Software Oakland CA USA Natl Org Med Cholargos Greece Univ Crete Dept Comp Sci Rethimnon Greece

When visualizing graphs, it is essential to communicate the meaning of each graph object via text or graphical labels. Automatic placement of labels in a graph is an NP-Hard problem, for which efficient heuristic solutions have been recently developed. In this paper, we describe a general framework for modeling, drawing, editing, and automatic placement of labels respecting user constraints. In addition, we present the interface and the basic engine of the graph Editor Toolkit - a family of portable graph visualization libraries designed for integration into graphical user interface application programs. This toolkit produces a high quality automated placement of labels in a graph using our framework. A brief survey of automatic label placement algorithms is also presented. Finally we describe extensions to certain existing automatic label placement algorithms, allowing their integration into this visualization tool. (c) 2007 Elsevier Inc. All rights reserved.

关键词： graph visualization graph labeling automatic label placement

来源：评论

学校读者我要写书评

暂无评论

Ambiguity-Free Edge-Bundling for Interactive graph visualization

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER graphICS 2012年第5期18卷 810-821页

作者： Luo, Sheng-Jie Liu, Chun-Liang Chen, Bing-Yu Ma, Kwan-Liu Natl Taiwan Univ Taipei 10617 Taiwan Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e. g., transportation networks, citation networks, or social networks). graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.

关键词： graph visualization network visualization edge ambiguity edge congestion edge bundling detail-on-demand interactive navigation

来源：评论

学校读者我要写书评

暂无评论

A Study of Layout, Rendering, and Interaction Methods for Immersive graph visualization

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER graphICS 2016年第7期22卷 1802-1815页

作者： Kwon, Oh-Hyun Muelder, Chris Lee, Kyungwon Ma, Kwan-Liu Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Ajou Univ Suwon 441749 South Korea Ajou Univ Dept Digital Media Suwon 441749 South Korea

Information visualization has traditionally limited itself to 2D representations, primarily due to the prevalence of 2D displays and report formats. However, there has been a recent surge in popularity of consumer grade 3D displays and immersive head-mounted displays (HMDs). The ubiquity of such displays enables the possibility of immersive, stereoscopic visualization environments. While techniques that utilize such immersive environments have been explored extensively for spatial and scientific visualizations, contrastingly very little has been explored for information visualization. In this paper, we present our considerations of layout, rendering, and interaction methods for visualizing graphs in an immersive environment. We conducted a user study to evaluate our techniques compared to traditional 2D graph visualization. The results show that participants answered significantly faster with a fewer number of interactions using our techniques, especially for more difficult tasks. While the overall correctness rates are not significantly different, we found that participants gave significantly more correct answers using our techniques for larger graphs.

关键词： graph visualization virtual reality immersive environments head-mounted display

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：