Straight-line drawings on restricted integer grids in two and three dimensions

Journal of Graph Algorithms and Applications

Volumn 7, Issue 4, 2003, Pages 363-398

  Felsner, Stefan ^a   Liotta, Giuseppe ^b   Wismath, Stephen ^c  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF PERUGIA   (Italy)

^c UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS;

3D GRID; ARBITRARY GRAPHS; GRID POINTS; LINE CROSSINGS; OUTERPLANAR GRAPH; PLANAR GRAPH; STRAIGHT-LINE DRAWINGS; THREE DIMENSIONS; TWO-DIMENSIONAL; TWO-DIMENSIONS;

PRISMS;

EID: 4644280823     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00075     Document Type: Article

References (43)

1. T. Biedl, T.M. Chan, A. López-Ortiz. Drawing K2,n: A Lower Bound. In Proc. 14th Can. Conf. on Comput. Geom., 146-148, 2002
2. P. Bose, J. Czyzowicz, P. Morin, D. Wood. The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. Technical Report TR-02-04, School of Computer Science, Carleton University, 1-4, Oct. 2002.
3. 2) volume. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 53-62. Springer-Verlag, 1997.
4. M. Capobianco and J. Molluzzo. Examples and Counterexamples in Graph Theory. North-Holland p.169 1978.
5. T.M. Chan. A near-linear area bound for drawing binary trees. In Proc. 10th ACM-SIAM Sympos. on Discrete Algorithms., pages 161-168, 1999.
6. M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl., 7(3):211-223, 1997.
7. M. Chrobak, M.T. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 319-328, 1996.
8. M. Chrobak, and S. Nakano. Minimum-width grid drawings of plane graphs. Comput. Geom. Theory Appl., 11:29-54, 1998.
9. R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17:199-208, 1997.
10. S. Cornelsen, T. Schank, and D. Wagner. Drawing Graphs on Two and Three Lines. Graph Drawing 2002, Lecture Notes in Comput. Sci. 2528, pages 31-41, Springer, 2002.
11. H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. In Proc. 20th ACM Sympos. Theory Comput., pages 426-433, 1988.
12. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41-51, 1990.
13. H. de Fraysseix, personal communication.
14. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
15. R. Diestel. Graph theory. Graduate Texts in Mathematics. 173. Springer, 2000. Transl. from the German. 2nd ed.
16. E. Di Giacomo, G. Liotta and S.K. Wismath. Drawing Series-Parallel Graphs on a Box. 14th Canadian Conference On Computational Geometry (CCCG '02), pages 149-153, 2002.
17. V. Dujmović and D.R. Wood. Tree-Partitions of k-Trees with Applications in Graph Layout. 29th Workshop on Graph Theoretic Concepts in Computer Science (Proc. WG '03), Lecture Notes in Comput. Sci., Springer-Verlag, to appear.
18. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. Mc-Cartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D.R. Wood. A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001, Lecture Notes in Comput. Sci. 2265, pages 1-15, Springer, 2002.
19. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. Mc-Cartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D.R. Wood. On the Parameterized Complexity of Layered Graph Drawing. ESA, 1-12, 2001.
20. V. Dujmović, P. Morin, and D.R. Wood. Path-Width and Three-Dimensional Straight-Line Grid Drawing of Graphs. Proc. of 10th International Symposium on Graph Drawing (GD '02), Lecture Notes in Comput. Sci. 2528, pages 42-53, Springer, 2002.
21. S. Felsner. Convex drawings of planar graphs and the order dimension of 3-polytopes. Order,18, 19-37, 2001.
22. S. Felsner, G. Liotta and S. Wismath. Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. In M. Jünger and P. Mutzel, editor, Graph Drawing (Proc. GD '01), volume 2265 of Lecture Notes Comput. Sci., pages 328-343. Springer-Verlag, 2002.
23. A. Garg, M. T. Goodrich, and R. Tamassia. Planar upward tree drawings with optimal area. Internat. J. Comput. Geom. Appl., 6:333-356, 1996.
24. th Annu. European Sympos. Algorithms, volume 1136 of Lecture Notes Comput. Sci., pages 12-26. Springer-Verlag, 1996.
25. M. Juenger and S. Leipert. Level planar embedding in linear time. In J. Kratochvil, editor, Graph Drawing (Proc. GD '99), volume 1731 of Lecture Notes Comput. Sci., pages 72-81. Springer-Verlag, 1999.
26. rd Annu. IEEE Sympos. Found. Comput. Sci., pages 101-110, 1992.
27. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996.
28. L.M. Kirousis and C.H. Papadimitriou. Searching and pebbling. Theor. Comput. Sci. 47, 205-218 (1986).
29. N. Meggido, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou. The complexity of searching a graph. JACM 35, 18-44, 1988.
30. R.H. Möhring, Graph problems related to gate matrix layout and PLA folding. Computational graph theory, Comput. Suppl. 7, 17-51 (1990).
31. J. Pach, T. Thiele, and G. Tóth. Three-dimensional grid drawings of graphs. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), Lecture Notes Comput. Sci. 1353, pages 47-51. Springer-Verlag, 1997.
32. T. Parsons. Pursuit-evasion in a graph. In Alavi and Lick editors, Theory and Applications of Graphs, Springer-Verlag, 426-441, 1976.
33. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990.
34. N. Robertson and P.D. Seymour. Graph Minors I. Excluding a Forest. J. of Comb. Th (B) 35, 39-61 (1983).
35. N. Robertson and P.D. Seymour. Graph minors - a survey. in Surveys in combinatorics 1985, (Pap. 10th Br. Combin. Conf. 1985), Lond. Math. Soc. Lect. Note Ser. 103, 153-171 (1985)
36. T. Schank. Algorithmen zur Visualisierung planarer, partitionierter Graphen. Master Thesis, Universiẗat Konstanz, 2001. http://scampi.physik.uni-konstanz.de/thomas/fmi/download/zula.ps
37. P. Scheffler. Optimal embedding of a tree into an interval graph in linear time. Combinatorics, graphs and complexity, Proc. 4th Czech. Symp., Prachatice/ Czech. 1990, Ann. Discrete Math. 51, 287-291 (1992).
38. W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st ACMSIAM Sympos. Discrete Algorithms, pages 138-148, 1990.
39. W. Schnyder and W.T. Trotter. Convex embeddings of 3-connected plane graphs. Abstracts of the AMS, 13(5):502, 1992.
40. M. Suderman. Pathwidth and Layered Drawings of Trees. Technical Report, School of Comp. Sci., McGill Univ., SOCS-02.8, 2002.
41. K. Wagner. Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114, 570-590 (1937).
42. D.R. Wood. Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. 22nd Foundations of Software Technology and Theoretical Computer Science (FSTTCS '02), Lecture Notes in Computer Science 2556, Springer-Verlag, pages 348-359, 2002.
43. G. M. Ziegler. Lectures on Poytopes. Springer-Verlag, 1995.