Two-dimensional packing algorithms for layout of disconnected graphs

Files

Two-dimensional packing algorithms for layout of disconnected graphs.pdf (465.1 KB)

Date

2002

Authors

Dogrusoz, U.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Information Sciences

Print ISSN

0020-0255
1872-6291

Electronic ISSN

Publisher

Elsevier

Volume

143

Issue

1-4

Pages

147 - 158

Language

English

Type

Article

Journal Title

Journal ISSN

Volume Title

Series

Abstract

We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they perform well are analyzed. © 2002 Elsevier Science Inc. All rights reserved.

Course

Other identifiers

Book Title

Keywords

Graph Layout , Graph Visualization , Two-Dimensional Packing , Algorithms , Aspect Ratio , Computer Simulation , Graph Theory , Graph Layouts , Graph Visualization , Information Analysis

Citation

Permalink

http://hdl.handle.net/11693/24693

item.page.isversionof

http://dx.doi.org/10.1016/S0020-0255(02)00183-4

Collections

Department of Computer Engineering