Drawing of Two-Dimensional Irregular Meshes

Aggarwal, Alok and Kosaraju, Rao and Pop, Mihai (1998) Drawing of Two-Dimensional Irregular Meshes. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 1-14 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_1).

Full text not available from this repository.

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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-37623-2_1
Classifications:M Methods > M.999 Others
Z Theory > Z.999 Others
G Algorithms and Complexity > G.490 Embeddings
M Methods > M.600 Planar
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.999 Others
P Styles > P.540 Planar
ID Code:198

Repository Staff Only: item control page

References

G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Electronically available at ftp://wilma.cs.brown.edu/pub/papers/compgeo/gdbiblio.ps.gz

T. Chan, M.T. Goodrich, S.R. Kosaraju, and R. Tamassia. Optimizing area and aspect ratio in straight-line orthogonal tree drawings. In Proc. of the Symp. on Graph Drawing, GD'96, pages 63-75. Springer Verlag, September 1996.

P. Eades, A. Symvonis, and S. Whitesides. Two Algorithms for Three Dimensional Orthogonal Graph Drawing. In Proc. of the Symp. on Graph Drawing, GD'96, pages 139-154. Springer Verlag, September 1996.

A. Fiat and A. Shamir. Polymorphic arrays: A novel VLSI layout for systolic computers. In 25th Annual Symposium on Foundations of Computer Science, pages 37-45, Los Angeles, Ca., USA, October 1984. IEEE Computer Society Press.

A. Garg, M.T. Goodrich, and R. Tamassia. Planar upward tree drawings with optimal area. International Journal of Computational Geometry and Applications, 6(3):333-356, 1996.

C.E. Leiserson. Area-Efficient Graph Layouts (for VLSI). Proc. 21st Ann. IEEE Symp. on Found. Of Comp. Sci., pages 270-281, 1980.

A. Papakostas, J.M. Six and I.G. Tollis. Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing. In Proc. of the Symp. on Graph Drawing, GD'96, pages 371-386. Springer Verlag, September 1996.

A. Papakostas and I.G. Tollis. A Pairing Technique for Area-Efficient Orthogonal Drawings. In Proc. of the Symp. on Graph Drawing, GD'96, pages 355-370. Springer Verlag, September 1996.

J.D. Ullman. Computational aspects of VLSI. Computer Science Press, Rockville, MD (1984).