Orthogonal Graph Drawing
Orthogonal Graph Drawing is a type of node-link diagram in which edges are routed exclusively along horizontal and vertical line segments, with vertices represented as points or boxes and edges meeting at right angles, to enhance readability and minimize edge crossings in graph layouts.
37
Publications
1.5K
Citations
56
Authors
23
Institutions
Publications per year
2017–2026
0
Variants
Orthogonal Graph Layout
37
A better heuristic for orthogonal graph drawings
Thérèse Biedl, Goos Kant · Computational Geometry · 1998 · 171 citations
1–5 of 37
56
8
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 56
23
The University of Texas at Dallas
Richardson, United States
5 h-index
6 publications
262 citations

University of Waterloo
Waterloo, Canada
4 h-index
9 publications
170 citations
Brown University
Providence, United States
3 h-index
5 publications
698 citations

McGill University
Montreal, Canada
3 h-index
3 publications
102 citations

Carleton University
Ottawa, Canada
3 h-index
3 publications
66 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
3 h-index
10 publications
189 citations
University of Perugia
Perugia, Italy
2 h-index
4 publications
67 citations
Hearst (United States)
New York, United States
2 h-index
2 publications
31 citations
1–8 of 23
JGAA · 12 publications · 362 citations
11
h-index
4 publications · 80 citations
4
h-index
4 publications · 282 citations
4
h-index
2 publications · 87 citations
2
h-index
TALG · 2 publications · 40 citations
2
h-index
1–5