New results on a visibility representation of graphs in 3D

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1027, Issue , 1996, Pages 234-241

  Fekete, Sándor P ^a   Houle, Michael E ^b   Whitesides, Sue ^c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

VISIBILITY;

3-DIMENSIONAL; LINE OF SIGHT; NEW RESULTS; SHARP BOUNDS; UNIT DISC; UNIT SQUARES; UPPER BOUND; VISIBILITY REPRESENTATION;

DRAWING (GRAPHICS);

EID: 84947917519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021807     Document Type: Conference Paper

References (13)

1. H. Alt, M. Godau and S. Whitesides. Universal 3-dimensional visibility representations for graphs. See elsewhere in these proceedings.
2. P. Bose, H. Everett, S. Fekete, A.Lubiw, H. Meijer, K. Romanik, T. Shermer and S. Whitesides. On a visibility representation for graphs in three dimensions. Proc. Graph Drawing'93, Paris (Sevres), 1993, pp. 38-39.
3. P. Bose, H. Everett, S. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer and S. Whitesides. On a visibility representation for graphs in three dimensions. Snapshots of Computational and Discrete Geometry, v. 3, eds. D. Avis and P. Bose, McGill University School of Computer Science Technical Report SOCS-94.50, July 1994, pp.2-25.
4. R. Cohen, P. Eades, T. Lin and F. Ruskey. Three-dimensional graph drawing. Proc. Graph Drawing'94, Princeton NJ, 1994, Lecture Notes in Computer Science LNCS #894, Springer-Verlag, 1995, pp. 1-11.
5. F. R. K. Chung. On unimodal subsequences. J. Combinatorial Theory, Series A, v. 29, 1980, pp. 267-279.
6. A. Dean and J. Hutchison. Rectangle visibility representations of bipartite graphs. Proc. Graph Drawing'94, Princeton NJ, 1994. Lecture Notes in Computer Science LNCS #894, Springer-Verlag, 1995, pp. 159-166.
7. th Berkeley Symp. Math. Stat. Prob., U. of California Press, 1972, pp. 345-394.
8. H. Koike. An application of three-dimensional visualization to object-oriented programming. Proc. of Advanced Visual Interfaces AVI'92, Rome, May 1992, v. 36 of World Scientific Series in Computer Science, 1992, pp. 180-192.
9. E. Kranakis, D. Krizanc and J. Urrutia. On the number of directions in visibility representations of graphs. Proc. Graph Drawing'94, Princeton NJ, 1994, Lecture Notes in Computer Science LNCS #894, Springer-Verlag, 1995, pp. 167-176.
10. J. Mackinley, G. Robertson and S. Card. Cone trees: animated 3d visualizations of hierarchical information. Proc. of the SIGCHI Conf. on Human Factors in Computing, 1991, pp. 189-194.
11. K. Romanik. Directed VR-representable graphs have unbounded dimension. Proc. Graph Drawing'94, Princeton, NJ, 1994, Lecture Notes in Computer Science LNCS #894, Springer-Verlag, 1995, pp. 177-181.
12. R. Tamassia and I. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. v. 1, 1986, pp. 321-341.
13. S. Wismath. Characterizing bar line-of-sight graphs. Proc. ACM Symp. on Computational Geometry, 1985, pp. 147-152.