A layout algorithm for undirected compount graphs

Simple item page
buir.advisorDoğrusöz, Uğur
dc.contributor.authorGiral, Erhan
dc.date.accessioned2016-07-01T11:03:43Z
dc.date.available2016-07-01T11:03:43Z
dc.date.issued2005
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractGraph layout is an important problem in information visualization. All datadriven graph-based information visualization systems require some sort of an automatic geometry generation mechanism, as it is generally not directly available from the data being modeled. This is why graph layout problem has been studied extensively. However, for the case of compound graphs, there are still important gaps in this area. We present a new, elegant algorithm for undirected compound graph layout. The algorithm is based on the traditional force-directed layout scheme with extensions to handle nesting, varying node sizes, and possibly other application-specific constraints. 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 also been successfully implemented as part of a pathway integration and analysis toolkit named Patika for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions.en_US
dc.description.provenanceMade available in DSpace on 2016-07-01T11:03:43Z (GMT). No. of bitstreams: 1 0002916.pdf: 1854381 bytes, checksum: 5e10f7c2f140862c05f39e6b571ddf03 (MD5) Previous issue date: 2005en
dc.description.statementofresponsibilityGiral, Erhanen_US
dc.format.extentxi, 50 leaves, illustrationsen_US
dc.identifier.itemidBILKUTUPB093781
dc.identifier.urihttp://hdl.handle.net/11693/29708
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectVisualizationen_US
dc.subjectGraph Visualizationen_US
dc.subjectGraph Drawingen_US
dc.subjectForce Directed Graph Layouten_US
dc.subjectCompound Graphsen_US
dc.subject.lccT385 .G57 2005en_US
dc.subject.lcshComputer graphics.en_US
dc.titleA layout algorithm for undirected compount 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:
0002916.pdf
Size:
1.77 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science