GRAPH VISUALIZATION BASED ON RECTANGULAR DUAL

1
GRAPH VISUALIZATION BASED ON RECTANGULAR DUAL
Gianluca Quercini PhD Student Disi
Dipartimento di Informatica e Scienze
dell'Informazione Università degli Studi di Genova
Sydney, Wed November 21, 2007
2
Rectangular Dual
3
Lai Leinwald
A graph admits a rectangular dual iff
1) It is planar
2) Its internal faces are triangular
3) It does not contain separating triangles
4
Rectangular Dual of any Planar Graph
Biedl, Kant, Kaufmann, 1995
Kant He, 1993
Chiba Nishizeki, 1985
5
Breaking the Separating Triangles
Problem Adding a minimal set of crossover
vertices to break all the
separating triangles
6
A Polynomial AlgorithmAccornero, Ancona, Varini
2000
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
Towards a linear-time algorithm
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
Applications
24
3D Electronic Institutions
Rectangular dual
EI to 3D Worlds
25
Cartograms
Weighted Rectangular Dual
26
Graph Drawing
Goal to obtain a pleasant drawing
3D Graph Drawing
Large graphs
Fish-eye lens
Clustering
Traditional graph drawing representations
Rectangular Dual
27
(No Transcript)
28
Clustering by Rectangular Dualization
29
(No Transcript)
30
(No Transcript)