Fast compound graph layout with constraint support

buir.advisorDoğrusöz, Uğur
dc.contributor.authorBalcı, Hasan
dc.date.accessioned2022-08-19T11:34:01Z
dc.date.available2022-08-19T11:34:01Z
dc.date.copyright2022-08
dc.date.issued2022-08
dc.date.submitted2022-08-18
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Ph.D.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2022.en_US
dc.descriptionIncludes bibliographical references (leaves 78-84).en_US
dc.description.abstractVisual analysis of relational data becomes more challenging in today's world as the amount of data increases exponentially. Effective visual display of such data is therefore a key requirement to simplify the analysis process. Compound graphs present a practical structure for both representing the relational data with varying levels of groupings or abstractions and managing its complexity. In addition, a good automatic layout of these graphs lets users understand relationships, uncover new insights and find important patterns hidden in the data. To this end, we introduce a new layout algorithm named fCoSE (fast Compound Spring Embedder) for compound graphs with support for user-specified placement constraints. fCoSE combines the speed of spectral layout with the aesthetics and quality of force-directed layout while satisfying specified constraints and properly displaying compound structures. The algorithm first generates a draft layout with the help of a spectral approach, then enforces placement constraints by using newly introduced heuristics and finally polishes the layout via a force-directed layout algorithm modified to maintain enforced constraints. Our experiments performed on both real-life and randomly generated graphs verify that fCoSE outperforms its competitors in terms of both speed and generally accepted graph layout criteria and is fast enough to be used in interactive applications with small to medium-sized graphs.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2022-08-19T11:34:01Z No. of bitstreams: 1 B161175.pdf: 23039748 bytes, checksum: 04818c4421b9f5fb77288e6688b74a66 (MD5)en
dc.description.provenanceMade available in DSpace on 2022-08-19T11:34:01Z (GMT). No. of bitstreams: 1 B161175.pdf: 23039748 bytes, checksum: 04818c4421b9f5fb77288e6688b74a66 (MD5) Previous issue date: 2022-08en
dc.description.statementofresponsibilityby Hasan Balcıen_US
dc.format.extentxvi, 84 leaves : illustrations, charts (color) ; 30 cm.en_US
dc.identifier.itemidB161175
dc.identifier.urihttp://hdl.handle.net/11693/110459
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInformation visualizationen_US
dc.subjectGraph layouten_US
dc.subjectVisual analyticsen_US
dc.subjectCompound graphsen_US
dc.subjectConstrained layouten_US
dc.subjectSpectral graph drawingen_US
dc.titleFast compound graph layout with constraint supporten_US
dc.title.alternativeKısıt destekli hızlı bileşik çizge yerleştirmeen_US
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelDoctoral
thesis.degree.namePh.D. (Doctor of Philosophy)

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
B161175.pdf
Size:
21.97 MB
Format:
Adobe Portable Document Format
Description:
Full printable version

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: