On Spectral Graph Drawing
On Spectral Graph Drawing
复制标题
DOI：
10.1007/3-540-45071-8_50
复制
发表时间：
2003-07
期刊：
影响因子：
--
通讯作者：
Y. Koren
中科院分区：
文献类型：
--
作者：
Y. Koren
图可视化的谱方法使用相关矩阵的某些特征向量来计算图的布局。这种方法的一些重要优点是(根据特定要求)计算最佳布局的能力和非常快的计算时间。在本文中，我们探索了光谱可视化技术并研究了它们的性质。我们提出了一种新的频谱方法，它提供了特征向量和布局美学属性之间的直接联系。此外，我们还提出了一种新的光谱绘制方法，具有一定的美学优势。这种表述伴随着一种美观的算法，它比计算特征向量的标准数值算法更容易理解和实现。
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we explore spectral visualization techniques and study their properties. We present a novel view of the spectral approach, which provides a direct link between eigenvectors and the aesthetic properties of the layout. In addition, we present a new formulation of the spectral drawing method with some aesthetic advantages. This formulation is accompanied by an aesthetically-motivated algorithm, which is much easier to understand and to implement than the standard numerical algorithms for computing eigenvectors.