dc.contributor.advisor | Doğrusöz, Uğur | |
dc.contributor.author | Başköy, Cihad | |
dc.date.accessioned | 2016-07-01T10:56:39Z | |
dc.date.available | 2016-07-01T10:56:39Z | |
dc.date.issued | 2003 | |
dc.identifier.uri | http://hdl.handle.net/11693/29260 | |
dc.description | Cataloged from PDF version of article. | en_US |
dc.description.abstract | Graph 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.statementofresponsibility | Başköy, Cihad | en_US |
dc.format.extent | ix, 46 leaves, ill, 29 cm | en_US |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Graph Layout | en_US |
dc.subject | Disconnected Graph Layout | en_US |
dc.subject | Two-Dimensional Packing | en_US |
dc.subject.lcc | T385 .B37 2003 | en_US |
dc.subject.lcsh | Computer graphics. | en_US |
dc.title | Polygon packing approach to disconnected graph layout | en_US |
dc.type | Thesis | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.publisher | Bilkent University | en_US |
dc.description.degree | M.S. | en_US |
dc.identifier.itemid | BILKUTUPB069767 | |