INFORMATION VISUALIZATION BY GRAPH DRAWING ALGORITHMS

为了使图形绘制算法更有效地用于信息可视化，我们提出了以下算法：(1)生成基本保持给定直线图形中相对顶点位置的图形的正交图的算法；(2)提高图形直线绘制质量的算法；(3)确定层次图形中顶点坐标和共享虚拟顶点的算法；(4)面向力的绘制不连通图形的算法；(5)寻找带有矩形顶点的图形图形的算法。

In order to make graph drawing algorithms more effective for information visualization, we have developed the following algorithms :(1) an algorithm for producing an orthogonal drawing of a graph that basically preserves the relative vertex positions in a given straight-line drawing,(2) an algorithm for improving the quality of a straight-line drawing of a graph,(3) algorithms for determining the vertex coordinates and for sharing dummy vertices in a hierarchical graph drawing,(4) a force-oriented algorithm for drawing a disconnected graph, and(5) an algorithm for finding a graph drawing with rectangular vertices.