A circular layout algorithm for clustered graphs

Simple item page
buir.advisorDoğrusöz, Uğur
dc.contributor.authorBelviranlı, Mehmet Esat
dc.date.accessioned2016-01-08T18:11:17Z
dc.date.available2016-01-08T18:11:17Z
dc.date.issued2009
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2009.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2009.en_US
dc.descriptionIncludes bibliographical references leaves 48-51.en_US
dc.description.abstractVisualization of information is essential for comprehension and analysis of the acquired data in any field of study. Graph layout is an important problem in information visualization and plays a crucial role in the drawing of graph-based data. There are many styles and ways to draw a graph depending on the type of the data. Clustered graph visualization is one popular aspect of the graph layout problem and there have been many studies on it. However, only a few of them focus on using circular layout to represent clusters. We present a new, elegant algorithm for layout of clustered graphs using a circular style. The algorithm is based on traditional force-directed layout scheme and uses circles to draw each cluster in the graph. In addition it can handle non-uniform node dimensions. It is the first algorithm to properly address layout of the quotient graph while considering inter-cluster relations as well as intra-cluster edge crossings. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has been successfully implemented as part of Chisio, version 1.1. Chisio is an open source general purpose graph editor developed by i-Vis (information visualization) Research Group of Bilkent University.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T18:11:17Z (GMT). No. of bitstreams: 1 0003909.pdf: 4728676 bytes, checksum: be0c510b3f5fd0c7913ed757b5bda374 (MD5)en
dc.description.statementofresponsibilityBelviranlı, Mehmet Esaten_US
dc.format.extentx, 51 leaves, illustrationsen_US
dc.identifier.itemidB117730
dc.identifier.urihttp://hdl.handle.net/11693/14937
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInformation Visualizationen_US
dc.subjectGraph Visualizationen_US
dc.subjectGraph Drawingen_US
dc.subjectForce Directed Graph Layouten_US
dc.subjectClustered Graphsen_US
dc.subjectCircular Graph Layouten_US
dc.subject.lccT385 .B45 2009en_US
dc.subject.lcshComputer graphics.en_US
dc.subject.lcshVisualization.en_US
dc.subject.lcshLayout (Printing)en_US
dc.subject.lcshComputer drawing.en_US
dc.subject.lcshInformation visualization.en_US
dc.subject.lcshCluster analysis.en_US
dc.titleA circular layout algorithm for clustered graphsen_US
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0003909.pdf
Size:
4.51 MB
Format:
Adobe Portable Document Format
Download

Collections

Graduate School of Engineering and Science