Massive graph visualization : LDRD final report.

Wylie, Brian Neil ; Moreland, Kenneth D.

关键词: ALGORITHMS;    COMPUTER GRAPHICS;    SIZE Graphs-Charts.;    Threat evaluation;    Parallel algorithms.;    Visualization.;    Information visualization.;   

DOI  :  10.2172/921736
RP-ID  :  SAND2007-6307
PID  :  OSTI ID: 921736
Others  :  TRN: US200806%%20

学科分类：社会科学、人文和艺术（综合）

美国|英语

来源: SciTech Connect

【 摘 要 】

Graphs are a vital way of organizing data with complex correlations. A good visualization of a graph can fundamentally change human understanding of the data. Consequently, there is a rich body of work on graph visualization. Although there are many techniques that are effective on small to medium sized graphs (tens of thousands of nodes), there is a void in the research for visualizing massive graphs containing millions of nodes. Sandia is one of the few entities in the world that has the means and motivation to handle data on such a massive scale. For example, homeland security generates graphs from prolific media sources such as television, telephone, and the Internet. The purpose of this project is to provide the groundwork for visualizing such massive graphs. The research provides for two major feature gaps: a parallel, interactive visualization framework and scalable algorithms to make the framework usable to a practical application. Both the frameworks and algorithms are designed to run on distributed parallel computers, which are already available at Sandia. Some features are integrated into the ThreatView{trademark} application and future work will integrate further parallel algorithms.