Proximity Drawings: Three Dimensions Are Better than Two

Extended Abstract
  • Paolo Penna
  • Paola Vocca
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)


We consider weak Gabriel drawings of unbounded degree trees in the three-dimensional space. We assume a minimum distance between any two vertices. Under the same assumption, there exists an exponential area lower bound for general graphs. Moreover, all previously known algorithms to construct (weak) proximity drawings of trees, generally produce exponential area layouts, even when we restrict ourselves to binary trees. In this paper we describe a linear-time polynomial-volume algorithm that constructs a strictly-upward weak Gabriel drawing of any rooted tree with O(log n)-bit requirement. As a special case we describe a Gabriel drawing algorithm for binary trees which produces integer coordinates and n 3-area representations. Finally, we show that an infinite class of graphs requiring exponential area, admits linear-volume Gabriel drawings. The latter result can also be extended to β-drawings, for any 1 < β < 2, and relative neighborhood drawings.


Binary Tree Proximity Region Adjacent Vertex Outerplanar Graph Antipodal Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    H. Alt, M. Godau, and S. Whitesides. Universal 3-dimensional visibility representations for graphs. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD’ 95, volume 1027 of Lecture Notes in Computer Science, pages 8–19. Springer-Verlag, 1996.CrossRefGoogle Scholar
  2. [2]
    G. Di Battista, W. Lenhart, and G. Liotta. Proximity drawability: a survey. In Proc. Graph Drawing’ 94, Lecture Notes in Computer Science, pages 328–339. Springer Verlag, 1994.Google Scholar
  3. [3]
    G. DiBattista, G. Liotta, and S.H. Whitesides. The strenght of weak proximity. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD’ 95), volume 1027 of itLecture Notes in Computer Science, pages 178–189. Springer-Verlag, 1996.CrossRefGoogle Scholar
  4. [4]
    P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity constraints and representable trees. In Proc. Graph Drawing rs94, LNCS, pages 340–351. Springer-Verlag, 1994.Google Scholar
  5. [5]
    P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. Algorithmica, 16:83–110, 1996.zbMATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    M. Brown and M. Najork. Algorithm animation using 3d interactive graphics. In Proc. ACM Symp. on User Interface Software and Technology, pages 93–100, 1993.Google Scholar
  7. [7]
    T. Calamoneri and A. Sterbini. Drawing 2-, 3-and 4-colorable graphs in o( n 2) volume. In Stephen North, editor, Graph Drawing (Proc. GD’ 96 ), volume 1190 of Lecture Notes in Computer Science, pages 53–62. Springer-Verlag, 1997.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD rs94, volume 894 of Lecture Notes in Computer Science, pages 1–11. Springer-Verlag, 1995.Google Scholar
  10. [10]
    P. Eades and S. Whitesides. The realization problem for euclidean minimum spanning tree is NP-hard. In Proc. ACM Symp. on Computational Geometry, pages 49–56, 1994.Google Scholar
  11. [11]
    H. ElGindy, G. Liotta, A. Lubiw, H. Meijer, and S. H. Whitesides. Recognizing rectangle of influence drawable graphs. In Proc. Graph Drawing rs94, number LNCS, pages 352–363. Springer-Verlag, 1994.Google Scholar
  12. [12]
    K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259–278, 1969.CrossRefGoogle Scholar
  13. [13]
    A. Garg and R. Tamassia. GIOTTO3D: A system for visualizing hierarchical structures in 3d. In Stephen North, editor, Graph Drawing (Proc. GD)’ 96, volume 1190 of Lecture Notes in Computer Science, pages 193–200, 1997.Google Scholar
  14. [14]
    D.G. Kirkpatrick and J.D. Radke. A framework for computational morphology. In G.T. Toussaint, editor, Computational Geometry, pages 217–248, Amsterdam, Netherlands, 1985. North-Holland.Google Scholar
  15. [15]
    G. Liotta and G. Di Battista. Computing proximity drawings of trees in the 3-dimensional space. In Proc. 4th Workshop Algorithms Data Struct, volume 955 of Lecture Notes in Computer Science, pages 239–250. Springer-Verlag, 1995.Google Scholar
  16. [16]
    G. Liotta, R. Tamassia, J. G. Tollis, and P. Vocca. Area requirement of gabriel drawings. In Giancarlo Bongiovanni, Daniel Pierre Bovet, and Giuseppe Di Battista, editors, Proc. CIACrs97, volume 1203 of Lecture Notes in Computer Science, pages 135–146. Spriger-Verlag, 1997.Google Scholar
  17. [17]
    A. Lubiw and N. Sleumer. All maximal outerplanar graphs are relative neighborhood graphs. In Proc. CCCGrs93, pages 198–203, 1993.Google Scholar
  18. [18]
    J. MacKinley, G. Robertson, and S. Card. Cone trees: Animated 3d visualizations of hierarchical information. In Proc. of SIGCHI Conf. on Human Factors in Computing, pages 189–194, 1991.Google Scholar
  19. [19]
    D. W. Matula and R. R. Sokal. Properties of gabriel graphs relevant to geographic variation research and clustering of points in the plane. Geogr. Anal., 12:205–222, 1980.CrossRefGoogle Scholar
  20. [20]
    M. Patrignani and F. Vargiu. 3DCube: A tool for three dimensional graph drawing. In Giseppe Di Battista, editor, Graph Drawing (Proc. GD rs97), volume 1353 of Lecture Notes in Computer Science, pages 284–290. Springer-Verlag, 1997.CrossRefGoogle Scholar
  21. [21]
    J.D. Radke. On the shape of a set of points. In G.T. Toussaint, editor, Computational Morphology, pages 105–136, Amsterdam, The Netherlands, 1988. North-Holland.Google Scholar
  22. [22]
    S. Reiss. An engine for the 3D visualization of program information. J. Visual Languages and Computing, 6(3), 1995.Google Scholar
  23. [23]
    G.T. Toussaint. The relative neighborhood graph of a finite planar set. Pattern recognition, 12:261–268, 1980.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Paolo Penna
    • 1
  • Paola Vocca
    • 2
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità di Roma “La Sapienza’RomeItaly
  2. 2.Dipartimento di MatematicaUniversità di Roma “Tor Vergata”RomeItaly

Personalised recommendations