Three-dimensional Graph Drawing

Three-Dimensional Graph Drawing is a graph layout algorithm that extends node-link diagrams into three-dimensional space by assigning vertices to points in 3D Euclidean space and representing edges as curves or line segments, thereby distinguishing itself from two-dimensional counterparts through enhanced spatial capacity for reducing edge crossings and visual clutter in complex networks.

64

Publications

3.2K

Citations

105

Authors

64

Institutions

Publications per year

2017–2026

1

Authors

105

  1. DR
    David R. Wood

    Carleton University, Canada

    8 publications · 287 citations

    8

    h-index

  2. TN
    Takao Nishizeki

    Tohoku University, Japan

    5 publications · 131 citations

    5

    h-index

  3. XH
    Xin He

    University at Buffalo, State University of New York, United States

    5 publications · 253 citations

    5

    h-index

  4. MS
    Md. Saidur Rahman

    Bangladesh University of Engineering and Technology, Bangladesh

    4 publications · 82 citations

    4

    h-index

  5. PR
    Peter Rodgers

    University of Kent, United Kingdom

    4 publications · 608 citations

    4

    h-index

1–5 of 105

Venues

  1. Journal of Graph Algorithms and Applications

    JGAA · 8 publications · 258 citations

    8

    h-index

  2. Algorithmica

    5 publications · 126 citations

    5

    h-index

  3. Computational Geometry

    4 publications · 98 citations

    4

    h-index

  4. Theoretical Computer Science

    3 publications · 241 citations

    3

    h-index

  5. Discrete & Computational Geometry

    2 publications · 60 citations

    2

    h-index

1–5