Show simple item record

dc.contributor.advisorDoğrusöz, Uğuren_US
dc.contributor.authorCengiz, Can Çağdaşen_US
dc.date.accessioned2016-01-08T20:18:33Z
dc.date.available2016-01-08T20:18:33Z
dc.date.issued2014
dc.identifier.urihttp://hdl.handle.net/11693/18357
dc.descriptionAnkara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2014.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2014.en_US
dc.descriptionIncludes bibliographical references leaves 55-58.en_US
dc.description.abstractGraphs are often used for visualizing relational data such as social or biological networks. Numerous methods have been proposed for automatic layout of simple graphs. However, simple graphs are usually insufficient in displaying relational information, since relational information is often clustered. Clustering models traditionally assume that each data point belongs to one and only one cluster; however, in complex networks, these clusters often overlap. For effective visualization of clustered graphs, the nodes in the same cluster should be placed together, respecting general graph drawing criteria such as avoiding node-node overlaps, minimizing edge crossings, and minimizing the total drawing area. Clustered graph layout problem becomes even more challenging when cluster overlaps are allowed. Here, we present a new algorithm for automatic layout of graphs with overlapping clusters based on force directed layout approach. The graph is first divided into zones according to clusters and their intersections, and new additional forces are introduced to the traditional spring embedder algorithm to keep nodes in the same cluster together, trying to keep neighboring nodes in separate clusters at a safe distance. Spring constants had to be fine-tuned to achieve a fast and effective layout operation. The algorithm was implemented and validated within a new layout style named Cluster Layout in the layout module of ChiEd visualization tool.en_US
dc.description.statementofresponsibilityCengiz, Can Çağdaşen_US
dc.format.extentxiii, 65 pages, illustrations, graphicsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraph Visualizationen_US
dc.subjectGraph Layouten_US
dc.subjectForce Directed Placementen_US
dc.subjectClustered Graphen_US
dc.subjectVisualization Softwareen_US
dc.subject.lccQA76.65 .C46 2014en_US
dc.subject.lcshVisual programming (Computer science)en_US
dc.subject.lcshVisual programming (Computer science)--Software.en_US
dc.titleA layout algorithm for graphs with overlapping clusters = Kesişen kümelenmiş çizgeler için bir yerleştirme algoritmasıen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB129094
dc.embargo.release2016-08-22


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record