Orthogonal Hypergraph Drawing is a hypergraph visualization method that represents hyperedges using orthogonal paths composed of horizontal and vertical line segments, distinguished by its constraint-based geometric layout to enhance readability and structural clarity.
6
Publications
142
Citations
11
Authors
9
Institutions
Publications per year
2017–2026
0
Parents
Publications
6
Orthogonal graph drawing with inflexible edges
Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter · Computational Geometry · 2016 · 20 citations
1–5 of 6
Authors
11
- DR
3
h-index
- TB
1
h-index
- SL
1
h-index
- TN
1
h-index
- BB
1
h-index
1–5 of 11
Institutions
9
Carleton University
Ottawa, Canada
2 h-index
2 publications
55 citations
NEC (Japan)
Tokyo, Japan
1 h-index
1 publications
32 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
3 publications
60 citations
Hasso Plattner Institute
Potsdam, Germany
1 h-index
1 publications
20 citations
The University of Texas at Dallas
Richardson, United States
1 h-index
1 publications
32 citations
Freie Universität Berlin
Berlin, Germany
1 h-index
1 publications
10 citations
McGill University
Montreal, Canada
1 h-index
1 publications
10 citations
NEC (United States)
Irving, United States
1 h-index
1 publications
32 citations
1–8 of 9
Venues
- Algorithmica
3 publications · 59 citations
3
h-index
- Computational Geometry
1 publications · 20 citations
1
h-index
- Theoretical Computer Science
1 publications · 38 citations
1
h-index
- Journal of Graph Algorithms and Applications
JGAA · 1 publications · 25 citations
1
h-index
1–4