Show simple item record

dc.contributor.advisorDoğrusöz, Uğur
dc.contributor.authorBaşköy, Cihad
dc.date.accessioned2016-07-01T10:56:39Z
dc.date.available2016-07-01T10:56:39Z
dc.date.issued2003
dc.identifier.urihttp://hdl.handle.net/11693/29260
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractGraph layout has become an important area of research in Computer Science for the last couple of decades. There is a wide range of applications for graph layout including data structures, databases, software engineering, VLSI technology, electrical engineering, production planning, chemistry, and biology. Most layout algorithms assume the graph to be connected. However, most graphs are disconnected and a method for putting the disconnected graph objects together is needed. Two-dimensional packing algorithms have wide area of application such as in the steel and textile industry. In steel industry, problems frequently occur when the need to stamp polygonal figures from a rectangular board arises. In the textile industry, similar problems exist. The aim is same: to maximize the use of the contiguous remainder of the board. Recently, two-dimensional packing has also been used in disconnected graph layout yielding algorithms that ‘tile’ the disconnected graph objects, which are represented by rectangles. These algorithms are also required to respect the specified aspect ratio for the final layout. A more recent approach to disconnected graph layout has been the use of polyominoes for representing the graph objects resulting in more accurate packings at the cost of increased execution times. In this thesis, we use polygons for a more accurate representation of graph objects and present new algorithms for disconnected graph layout. Specifically, we apply the No-Fit Polygon approach in twodimensional packing to disconnected graph layout. We present and analyze the graph layouts resulting from our new approach and contrast the new approach with previous ones.en_US
dc.description.statementofresponsibilityBaşköy, Cihaden_US
dc.format.extentix, 46 leaves, ill, 29 cmen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraph Layouten_US
dc.subjectDisconnected Graph Layouten_US
dc.subjectTwo-Dimensional Packingen_US
dc.subject.lccT385 .B37 2003en_US
dc.subject.lcshComputer graphics.en_US
dc.titlePolygon packing approach to disconnected graph layouten_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB069767


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record