Drawing of Two-Dimensional Irregular Meshes

Authors:
Alok Aggarwal;S. Rao Kosaraju;Mihai Pop
Affiliations:
-;-;-
Venue:
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Year:
1998

Citing 7
Cited 0

Two Algorithms for Three Dimensional Orthogonal Graph Drawing

GD '96 Proceedings of the Symposium on Graph Drawing
Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing

GD '96 Proceedings of the Symposium on Graph Drawing
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings

GD '96 Proceedings of the Symposium on Graph Drawing
A Pairing Technique for Area-Efficient Orthogonal Drawings

GD '96 Proceedings of the Symposium on Graph Drawing
Computational Aspects of VLSI

Computational Aspects of VLSI
Area-efficient graph layouts

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Polymorphic Arrays: A Novel VLSI Layout For Systolic Computers

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for transforming two-dimensional irregular meshes into square meshes with only a constant blow up in area. We also explore context invariant transformations of irregular meshes into square meshes and provide a lower bound for the transformation of down-staircases.