Ren Jing, Schneider Jens, Ovsjanikov Maks, Wonka Peter
IEEE Trans Vis Comput Graph. 2018 Sep;24(9):2546-2558. doi: 10.1109/TVCG.2017.2751473. Epub 2017 Sep 12.
We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.
我们提出了一种新颖且高效的方法来计算联合图布局，然后用它来可视化分割网格的集合。我们的联合图布局算法将一组图的邻接矩阵以及不同图的节点之间的部分（可能是软的）对应关系作为输入。然后我们使用一个两阶段过程，在第一步中，我们扩展谱图绘制以包含一个一致性项，以便可以联合处理一组图。我们的第二步将带有应力最大化的度量多维缩放扩展到联合布局设置，同时使用谱方法的输出作为初始化。此外，我们讨论了一个用于探索一组图的用户界面。最后，我们展示了源自分割网格集合的图的多个示例可视化，并与先前的工作进行了定性和定量比较。
