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 Kant & He, 1993Chiba & Nishizeki, 1985 Biedl, Kant, Kaufmann, 1995

5. Breaking the Separating Triangles Problem: Adding a minimal set of crossover vertices to break all the separating triangles

6. A Polynomial Algorithm Accornero, Ancona, Varini 2000

12. Towards a linear-time algorithm

23. Applications

24. 3D Electronic Institutions EI to 3D Worlds Rectangular dual

25. Cartograms Weighted Rectangular Dual

26. Graph Drawing Goal: to obtain a pleasant drawing Large graphs 3D Graph Drawing Fish-eye lens Clustering Traditional graph drawing representations Rectangular Dual

28. Clustering by Rectangular Dualization