Cluttered drawings of graphs cannot effectively convey the information of graphs. Two issues might cause node overlapping when one draws a picture of a graph. The first issue occurs when applying a layout algorithm fo...
详细信息
ISBN:
(纸本)9781920682279
Cluttered drawings of graphs cannot effectively convey the information of graphs. Two issues might cause node overlapping when one draws a picture of a graph. The first issue occurs when applying a layout algorithm for an abstract graph to a practical application in which nodes are labeled. The second is the changing of a node's size in a dynamic drawing system. This paper presents two algorithms, DNLS and ODNLS, for removing the two kinds of overlapping. The algorithms are based on the well-known spring embedder model. The outputs of the algorithms provide the features of spring algorithms. Experiments are carried out to compare DNLS and ODNLS to the Force Scan(FS) algorithm and its variants. The results demonstrate the advantages of DNLS and ODNLS in terms of some aesthetic criteria.
Graph drawing and visualization represent structural information as diagrams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). This paper presents a new E-spring algorit...
详细信息
Graph drawing and visualization represent structural information as diagrams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). This paper presents a new E-spring algorithm, extended from the popular spring embedder model, which eliminates node overlaps in clustered DAGs. In this framework, nodes are modeled as non-uniform charged particles with weights, and a final drawing is derived by adjusting the positions of the nodes according to a combination of spring forces and repulsive forces derived from electrostatic forces between the nodes. The drawing process needs to reach a stable state when the average distances of separation between nodes are near optimal. We introduce a stopping condition for such a stable state, which reduces equilibrium distances between nodes and therefore results in a significantly reduced area for DAG visualization. It imposes an upper bound on the repulsive forces between nodes based on graph geometry. The algorithm employs node interleaving to eliminate any residual node overlaps. These new techniques have been validated by visualizing eBay buyer-seller relationships and has resulted in overall area reductions in the range of 45-79%. (C) 2009 Elsevier Ltd. All rights reserved.
Presenting high-dimensional vectorized text set on 2D plane facilitates a quick perception of the similarity of their contents. This paper presents a practical visualization method used in web document mining system t...
详细信息
ISBN:
(纸本)9781424429097
Presenting high-dimensional vectorized text set on 2D plane facilitates a quick perception of the similarity of their contents. This paper presents a practical visualization method used in web document mining system to display the analysis result. The approach is derived from a classic algorithm. Because the original algorithm is not practical for our usage, we make a detailed analysis to the algorithm, and contribute a great improvement in order to put it into practice. In addition, this paper shows a comparative experiment acquired by our algorithm. To evaluate the algorithm we also propose a novel measurement which is supported by the positive experiment result.
暂无评论