Two-dimensional packing algorithms for layout of disconnected graphs

Authors:
Ugur Dogrusoz
Affiliations:
Computer Engineering Department, Bilkent University, Ankara 06533, Turkey
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2002

Citing 3
Cited 1

Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
From approximate to optimal solutions: a case study of number partitioning

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

A new algorithm for removing node overlapping in graph visualization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.