Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2546-2558 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Visualization and Computer Graphics |
| Volume | 24 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 12 2017 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledgements: M. Ovsjanikov’s work is funded through the following grants: Marie-Curie CIG-334283, a CNRS chaire d’excellence, chaire Jean Marjoulet from ´ Ecole Polytechnique, FUI project TANDEM 2, and a Google Focused Research Award. J. Ren, J. Schneider and P. Wonka are funded through the Visual Computing Center (VCC) at King Abdullah University of Science and Technology (KAUST).