Improving the quality of clustered graph drawing through a 'dummy element' approach

Hua, J; Huang, ML

Improving the quality of clustered graph drawing through a 'dummy element' approach

Hua, J Huang, ML

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 10th International Conference Computer Graphics, Imaging, and Visualization, CGIV 2013, 2013, pp. 88 - 92
Issue Date:: 2013-01-01

Closed Access

	Filename	Description	Size
	2013003660OK.pdf		210.58 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Hua, J	en_US
dc.contributor.author	Huang, ML https://orcid.org/0000-0002-6896-6480	en_US
dc.date.issued	2013-01-01	en_US
dc.identifier.citation	Proceedings - 10th International Conference Computer Graphics, Imaging, and Visualization, CGIV 2013, 2013, pp. 88 - 92	en_US
dc.identifier.isbn	9780769550510	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28360
dc.description.abstract	Clustered graphs have been widely consisted in Graph Drawing to overcome the problem of drawing large (or huge) graphs with thousands, or perhaps millions of nodes. Force-directed algorithm is one of the available approaches to draw such graphs with good layouts. However, the force directed methods are often produce very different layout outcomes based on different clustering algorithms that greatly affect the quality of the final result. In this paper, we propose a 'dummy element' approach for drawing clustered graphs by using the traditional force-directed algorithm. Our approach attempts to maximize the satisfaction of aesthetics in graph drawing. The experimental results shown that our new method can reduce the side effects on choosing different clustering methods and improve the quality of final layouts. © 2013 IEEE.	en_US
dc.relation.ispartof	Proceedings - 10th International Conference Computer Graphics, Imaging, and Visualization, CGIV 2013	en_US
dc.relation.isbasedon	10.1109/CGIV.2013.23	en_US
dc.title	Improving the quality of clustered graph drawing through a 'dummy element' approach	en_US
dc.type	Conference Proceeding
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
dc.location.activity	Macau, China	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

Clustered graphs have been widely consisted in Graph Drawing to overcome the problem of drawing large (or huge) graphs with thousands, or perhaps millions of nodes. Force-directed algorithm is one of the available approaches to draw such graphs with good layouts. However, the force directed methods are often produce very different layout outcomes based on different clustering algorithms that greatly affect the quality of the final result. In this paper, we propose a 'dummy element' approach for drawing clustered graphs by using the traditional force-directed algorithm. Our approach attempts to maximize the satisfaction of aesthetics in graph drawing. The experimental results shown that our new method can reduce the side effects on choosing different clustering methods and improve the quality of final layouts. © 2013 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/28360