The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2012 vol.18)
pp: 2699-2708
Xiaoru Yuan , Key Lab. of Machine Perception (Minist. of Educ.), Peking Univ., Beijing, China
Limei Che , Key Lab. of Machine Perception (Minist. of Educ.), Peking Univ., Beijing, China
Xin Zhang , Key Lab. of Machine Perception (Minist. of Educ.), Peking Univ., Beijing, China
ABSTRACT
In this paper, we propose a new strategy for graph drawing utilizing layouts of many sub-graphs supplied by a large group of people in a crowd sourcing manner. We developed an algorithm based on Laplacian constrained distance embedding to merge subgraphs submitted by different users, while attempting to maintain the topological information of the individual input layouts. To facilitate collection of layouts from many people, a light-weight interactive system has been designed to enable convenient dynamic viewing, modification and traversing between layouts. Compared with other existing graph layout algorithms, our approach can achieve more aesthetic and meaningful layouts with high user preference.
INDEX TERMS
social sciences computing, graph theory, interactive systems, user preference, intelligent graph layout, user input, graph drawing, crowd sourcing manner, Laplacian constrained distance embedding, light-weight interactive system, dynamic viewing, Layout, Laplace equations, Crowdsourcing, Stress, Algorithm design and analysis, Human factors, crowd sourcing, Graph layout, Laplacian matrix, force directed layout, stress model, merging, editing
CITATION
Xiaoru Yuan, Limei Che, Yifan Hu, Xin Zhang, "Intelligent Graph Layout Using Many Users' Input", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 12, pp. 2699-2708, Dec. 2012, doi:10.1109/TVCG.2012.236
REFERENCES
[1] M. Alexa., Mesh editing based on discrete laplace and poisson models. In ACM SIGGRAPH 2006 Courses, pages 51-59, 2006.
[2] D. Archambault, T. Munzner, and D. Auber, Topolayout: Multi-level graph layout by topological features IEEE Trans. Vis. Comput. Graph., 13(2): 305-317, 2007.
[3] D. Auber and Y. Chriricota., Improved efficiency of spring embedders: Taking advantage of gpu programming. In Visualization, Imaging, and Image Processing - 2007, pages 169-175, 2007.
[4] M. Baur and U. Brandes., Multi-circular layout of micro/macro graphs. In Proceedings of the 14th international conference on Graph drawing, 4875, pages 255-267, 2007.
[5] T. F. Cox and M. A. A., Cox Multidimensional Scaling. Chapman and Hall/CRC, 2000.
[6] U. Dogrusöz, B. Madden, and P. Madden., Circular layout in the graph layout toolkit. In Proceedings of the Symposium on Graph Drawing, GD ‘96, pages 92-100, 1996.
[7] T. Dwyer, Scalable, versatile and simple constrained graph layout Computer Graphics Forum, 28(3): 991-998, 2009.
[8] T. Dwyer,B. L. Danyel Fisher,K. Inkpen Quinn, P. Isenberg, G. Robertson,, and C. North., A comparison of user-generated and automatic graph layouts. In IEEE Symposium on Information Visualization, pages 961-968, 2009.
[9] T. Dwyer and Y. Koren., Dig-cola: Directed graph layout through constrained energy minimization. In Proceedings of the 2005 IEEE Symposium on Information Visualization, (Infovis‘05), pages 65-72, 2005.
[10] T. Dwyer, Y. Koren, and K. Marriott, Constrained graph layout by stress majorization and gradient projection Discrete Mathematics, 309(7): 1895-1908, 2009.
[11] T. Dwyer, K. Marriott, and M. Wybrow., Dunnart: A constraint-based network diagram authoring tool. In Proceedings of the 16th international conference on Graph Drawing, GD’08, pages 420-431, 2008.
[12] T. Dwyer and G. Robertson., Layout with circular and other non-linear constraints using procrustes projection. In Proceedings of the 17th international conference on Graph Drawing, 5849/2010 of GD’09, pages 393-404, 2009.
[13] P. Eades, A heuristic for graph drawing Congressus Numerantium, 42: 149-160, 1984.
[14] P. Eades, Q. Feng, X. Lin,, and H. Nagamochi., Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In Algorithmica, pages 113-128, 1996.
[15] M. Eiglsperger and M. Kaufmann., Fast compaction for orthogonal drawings with vertices of prescribed size. In the 9th International Symposium on Graph Drawing, GD ‘01, pages 124-138, 2001.
[16] Y. Frishman and A. Tal, Multi-level graph layout on the gpu IEEE Trans. Vis. Comput. Graph., 13(6): 1310-1319, November 2007.
[17] T. M J. Fruchterman and E. M. Reingold., Graph drawing by force-directed placement Software: Practice and Experience, 21: 1129-1164, 1991.
[18] E. R. Gansner, Y. Hu, and S. North., A maxent-stress model for graph layout. In Proceedings of IEEE Pacific Visualization Symposium, pages 73-80, 2012.
[19] E. R. Gansner and Y. Koren., Improved circular layouts. In Proceedings of the 14th international conference on Graph drawing, GD’06, pages 386-398, 2006.
[20] E. R. Gansner, Y. Koren, and S. North., Graph drawing by stress majorization. In Proceedings of the 12th international conference on Graph Drawing, GD’04, pages 239-250, 2004.
[21] S. Hachul and M. Hünger., Drawing large graphs with a potential field based multilevel algorithm. In Proceedings of the 12th international conference on Graph Drawing, GD’04, pages 285-295, 2004.
[22] Y. Hu, Efficient and high quality force-directed graph drawing Mathematica Journal, 10: 37-71, 2005.
[23] S. Ingram, T. Munzner, and M. Olano, Glimmer: Multilevel mds on the gpu IEEE Trans. Vis. Comput. Graph., 15(2): 249-261, 2009.
[24] T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs Information Processing Letters, 31: 7-15, 1989.
[25] Y. Li, E. Zhang, Y. Kobayashi,, and P. Wonka., Editing operations for irregular vertices in triangle meshes. ACM Trans. Graph., 29(6): 153:1-153:12, 2010.
[26] J. Marks, K. Ryall, and S. Shieber., An interactive constraint-based system for drawing graphs. In Proceedings of the 10th annual ACM symposium on User interface software and technology, pages 97-104, 1997.
[27] C. Papadopoulos and C. Voglis., Drawing graphs using modular decomposition. In Proceedings of the 13th international conference on Graph Drawing, GD’05, pages 343-354, 2005.
[28] O. Sorkine,D. Cohen-Or, Y. Lipman, M. Alexa,C. Rössl,, and H.-P. Seidel., Laplacian surface editing. In Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, SGP ‘04, pages 175-184, 2004.
[29] R. Tamassia, Constraints in graph drawing algorithms Constraints, 3(1): 87-120, 1998.
[30] F. van Ham and B. Rogowitz., Perceptual organization in user-generated graph layouts. IEEE Trans. Vis. Comput. Graph., 14(6): 1333-1339, 2008.
[31] C. Walshaw., A multilevel algorithm for force-directed graph drawing. In Proceedings of the 8th International Symposium on Graph Drawing, GD ‘00, pages 171-182, 2000.
[32] Y. Yu, K. Zhou, D. Xu., X. Shi, H. Bao., B. Guo, and H.-Y. Shum, Mesh editing with poisson-based gradient field manipulation ACM Trans. Graph., 23(3): 644-651, 2004.
[33] D. Zorin,P. Schröder,, and W. Sweldens., Interactive multiresolution mesh editing. In Proceedings of the 24th annual conference on Computer graphics and interactive techniques, SIGGRAPH ‘97, pages 259-268, 1997.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool