An orthogonal layout algorithm for small compound graphs

Simple item page
buir.advisorDoğrusöz, Uğur
dc.contributor.authorZaman, Mubashira
dc.date.accessioned2021-09-30T08:06:04Z
dc.date.available2021-09-30T08:06:04Z
dc.date.copyright2021-09
dc.date.issued2021-09
dc.date.submitted2021-09-28
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Master's): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2021.en_US
dc.descriptionIncludes bibliographical references (leaves 77-81).en_US
dc.description.abstractInformation visualization is the study of different approaches that aid in the visualization and examination of data. Among the broad variety of different op-tions and techniques available in this field is “Graph Drawing”, which is regarded as the algorithmic foundation of relational information or graph visualization. Graph drawing fuses graph theory and visualization for presenting data as geo-metric shapes and for laying them out in a 2-D or 3-D space. There exist many different types of automatic graph layouts. One such layout is the orthogonal graph layout in which edges are made up of horizontal and vertical segments. A specialized version of graphs called compound graphs are used to represent grouping or clustering of graph objects. Many orthogonal layout approaches have been presented for simple graphs but there is considerably less research available for orthogonal layout algorithms for compound graphs. In this thesis, we present C-TSM, which takes the already existing Topology-Shape-Metrics (TSM) approach and extends it to cater to 4-degree small compound graphs with uniform node sizes. First, compound graphs are converted to simple graphs and then the TSM approach is applied to it. The resulting output is compacted again in a post-processing step and then the graph is converted back to a compound graph. The results of performance tests on our algorithm show that C-TSM works considerably well on small-sized graphs and gives the output in up to a few seconds. This algorithm has been implemented in Javascript and Python and is available as a Cytoscape.js extension. The source code and a demo application are available on a GitHub repository.en_US
dc.description.degreeM.S.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2021-09-30T08:06:04Z No. of bitstreams: 1 10423404.pdf: 6345933 bytes, checksum: 23432ccb0b30032f0ff2796bc4b1030e (MD5)en
dc.description.provenanceMade available in DSpace on 2021-09-30T08:06:04Z (GMT). No. of bitstreams: 1 10423404.pdf: 6345933 bytes, checksum: 23432ccb0b30032f0ff2796bc4b1030e (MD5) Previous issue date: 2021-09en
dc.description.statementofresponsibilityby Mubashira Zamanen_US
dc.format.extentxi, 81 leaves : color charts, graphics ; 30 cm.en_US
dc.identifier.itemidB134515
dc.identifier.urihttp://hdl.handle.net/11693/76563
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInformation visualizationen_US
dc.subjectOrthogonal graph layouten_US
dc.subjectAutomatic lay-out algorithmen_US
dc.subjectCompound graphsen_US
dc.titleAn orthogonal layout algorithm for small compound graphsen_US
dc.title.alternativeKüçük bileşik çizgeler için dikey düzen yerleştirme algoritmasıen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
10423404.pdf
Size:
6.05 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dept. of Computer Engineering - Master's degree