A compound graph layout algorithm with support for ports

Simple item page
buir.advisorDoğrusöz, Uğur
dc.contributor.authorOkka, Alihan
dc.date.accessioned2020-11-05T07:54:29Z
dc.date.available2020-11-05T07:54:29Z
dc.date.copyright2020-10
dc.date.issued2020-10
dc.date.submitted2020-11-04
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2020.en_US
dc.descriptionIncludes bibliographical references (leaves 52-54).en_US
dc.description.abstractInformation visualization is a eld of study that aims to represent abstract data in an aesthetically pleasing and easy to comprehend visual manner. Various approaches and standards have been created to reinforce the discovery of unstructured insights that are limited to human cognition via visual depictions. Complex systems and processes are often modelled as graphs since it would be di cult to describe in text. A type of visualization, graph drawing, addresses the notion of creating geometric representations of graphs. There are plentiful research directed to designing automatic layout algorithms for visualizing graphs. Nevertheless, a limited number of studies utilize ports, which are dedicated connection points on the locations where edge ends link to their incident nodes. We propose a new automatic layout algorithm named CoSEP supporting port constraints on compound nodes used for nested levels of abstractions in data. The CoSEP algorithm is based on a force-directed algorithm, Compound Spring Embedder (CoSE). Additional heuristics and force types are introduced on top of existing physical model. Using CoSE's layout structure as a baseline enables CoSEP to handle non-uniform node sizes, arbitrary levels of nesting, and intergraph edges that may span multiple levels of nesting. Our experiments show that CoSEP signi cantly improves the quality of the layouts for compound graphs with port constraints with respect to commonly accepted graph drawing criteria, while running in at most a few seconds, suitable for use in interactive applications for small to medium sized graphs. The CoSEP algorithm is implemented in JavaScript as a Cytoscape.js extension, and the sources along with a demo are available on the associated GitHub repository.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2020-11-05T07:54:29Z No. of bitstreams: 1 10366217: 4505802 bytes, checksum: f68721f649659ba6880794086a61afb7 (MD5)en
dc.description.provenanceMade available in DSpace on 2020-11-05T07:54:29Z (GMT). No. of bitstreams: 1 10366217: 4505802 bytes, checksum: f68721f649659ba6880794086a61afb7 (MD5) Previous issue date: 2020-11en
dc.description.statementofresponsibilityby Alihan Okkaen_US
dc.embargo.release2021-05-02
dc.format.extentxiii, 59 leaves : color charts ; 30 cm.en_US
dc.identifier.itemidB125010
dc.identifier.urihttp://hdl.handle.net/11693/54406
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInformation visualizationen_US
dc.subjectGraph visualizationen_US
dc.subjectGraph drawingen_US
dc.subjectGraph layouten_US
dc.subjectForce directed graph layouten_US
dc.subjectCompound graphsen_US
dc.subjectGraph algorithmsen_US
dc.subjectPort constraintsen_US
dc.titleA compound graph layout algorithm with support for portsen_US
dc.title.alternativeBağlantı kısıtlarını destekleyen bileşik çizge yerleştirme algoritmasıen_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:
10366217.pdf
Size:
4.3 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science