Presentation is loading. Please wait.

Presentation is loading. Please wait.

Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman and Md. Jawaherul Alam Graph Drawing and Information Visualization Laboratory Department of Computer.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman and Md. Jawaherul Alam Graph Drawing and Information Visualization Laboratory Department of Computer."— Presentation transcript:

1 Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman and Md. Jawaherul Alam Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology (BUET) Dhaka – 1000, Bangladesh CCCG 2010August 11, 2010

2 Minimum-Area Drawings A Straight-Line Drawing of G A Straight-Line Grid-Drawing of G on 8×5 grid A Plane Graph G W = 8 H = 5 W = 6 H = 4 A Straight-Line Grid-Drawing of G on 6×4 grid CCCG 2010 August 11, 2010 2

3 Minimum-Area Drawings A Straight-Line Drawing of G A Straight-Line Grid-Drawing of G on 8×5 grid A Plane Graph G W = 8 H = 5 W = 6 H = 4 A Straight-Line Grid-Drawing of G on 6×4 grid A Minimum-Area Drawing of G CCCG 2010 August 11, 2010 3

4 Previous Results de Fraysseix et al. [1990] Straight- line grid-drawing of plane graphs with n vertices(2n−4)×(n−2) Schnyder [1990] Straight- line grid-drawing of plane graphs with n vertices(n−2)×(n−2) Brandenburg [2004] Straight- line grid-drawing of plane graphs with n vertices ( 4n / 3 ) × ( 2n / 3 ) Krug and Wagner [2008] Whether a planar graph has a drawing on a given areaNP-Complete This PresentationWhether a ‘plane 3-tree’ has a drawing on a given areaP CCCG 2010 August 11, 2010 4

5 Previous Results de Fraysseix et al. [1990] Straight- line grid-drawing of plane graphs with n vertices (2n−4)×(n−2) Schnyder [1990] Straight- line grid-drawing of plane graphs with n vertices (n−2)×(n−2) Brandenburg [2004] Straight- line grid-drawing of plane graphs with n vertices ( 4n / 3 ) × ( 2n / 3 ) Krug and Wagner [2008] Whether a plane graph has a drawing on a given area NP-Complete This PresentationWhether a ‘plane 3-tree’ has a drawing on a given area P Our Result We obtain minimum-area drawings for plane 3-trees in polynomial time CCCG 2010 August 11, 2010 5

6 a b c d e f g h i j k l m n o A plane 3-tree G Previous ResultsPlane 3-tree f g h i j k l m n o a b c d e CCCG 2010 August 11, 2010 6

7 a b c d e f g h i j k l m n o A plane 3-tree G Previous ResultsProperties of Plane 3-trees f g h i j k l m n o a b c d e CCCG 2010 August 11, 2010 c The representative vertex of G is the vertex which is neighbor of all the three outer vertices of G. The representative vertex of G o c g m n d f h i j d k l e A plane 3-tree 7

8 Previous ResultsOur Idea : Dynamic Programming CCCG 2010 August 11, 2010 a b c d e f g h i j k l m n o c o c g m n d f h i j d k l e A plane 3-tree G 8

9 Previous ResultsLet’s Try a Simpler Problem CCCG 2010 August 11, 2010 a b c a b c b c a a c b 9

10 No line is available to place the vertex l a b e c k l e a b c Previous ResultsLet’s Try a Simpler Problem CCCG 2010 August 11, 2010 a b c No line is available to place the representative vertex e a e c e k Let’s check whether this small plane 3-tree admits a drawing with this placement of a, b and c or not k l a b e c k l 10

11 Is Draw r (a y, b y, c y ) = True ? Previous ResultsProblem Formulation CCCG 2010 August 11, 2010 a b e c k l 3 2 1 Representative vertex e 133 c b a No line is available to place the representative vertex e Draw e (1, 2, 2) = False k l e a b c 11 Draw e (1, 3, 3) = True

12 k l e a b c Previous ResultsRecursive Solution CCCG 2010 August 11, 2010 Draw r (a y, b y, c y ) = False, if max{a y, b y, c y } − min{a y, b y, c y } = 0. 12

13 Draw r (a y, b y, c y ) = False, if max{a y, b y, c y } − min{a y, b y, c y } = 1 and r is an internal vertex. and r is an internal vertex. Previous ResultsRecursive Solution CCCG 2010 August 11, 2010 c b a No line is available to place the representative vertex k l e a b c Draw r (a y, b y, c y ) = False, if max{a y, b y, c y } − min{a y, b y, c y } = 0. 13

14 Draw r (a y, b y, c y ) = True, if max{a y, b y, c y } − min{a y, b y, c y } ≥ 1 and r is a dummy vertex. and r is a dummy vertex. Previous ResultsRecursive Solution CCCG 2010 August 11, 2010 c b a Draw r (a y, b y, c y ) = False, if max{a y, b y, c y } − min{a y, b y, c y } = 1 and r is an internal vertex. and r is an internal vertex. a b c Draw r (a y, b y, c y ) = False, if max{a y, b y, c y } − min{a y, b y, c y } = 0. 14

15 Previous ResultsRecursive Solution CCCG 2010 August 11, 2010 Draw r (a y, b y, c y ) = True, if max{a y, b y, c y } − min{a y, b y, c y } ≥ 1 and r is a dummy vertex. and r is a dummy vertex. Draw r (a y, b y, c y ) = False, if max{a y, b y, c y } − min{a y, b y, c y } = 1 and r is an internal vertex. and r is an internal vertex. Draw r (a y, b y, c y ) = False, if max{a y, b y, c y } − min{a y, b y, c y } = 0. r a b c Draw r (a y, b y, c y ) = v r y {Draw r (a y, b y, r y ) & Draw r (b y, c y, r y ) & Draw r (c y, a y, r y )}, otherwise. O(1) h O(h) 15

16 Previous ResultsComplexity Analysis CCCG 2010 August 11, 2010 Draw r (a y, b y, c y ) h O(h)... O(h) O(n) ×× × = O(nh 3 ) O(nh 3 ) × O(h) = O(nh 4 ) O(nh 4 ) × O(h min ) = O(nh 5 min ) h min Computation of each entry is obtained in O(h) time. O( nh 4 min ) 16

17 false A plane 3-tree G A minimum- area grid drawing of G Patch the drawings of the subproblems to obtain the final drawing. false Minimum-Area Grid Drawings of Plane 3-Trees CCCG 2010 August 11, 2010... 17

18 Lower Bound on Area ( 2n / 3 -1) CCCG 2010 August 11, 2010 There exist plane graphs with n vertices that takes area in any straight-line grid drawing. ⌊ 2(n-1) / 3 ⌋ × ⌊ 2(n-1) / 3 ⌋ area in any straight-line grid drawing. Nested triangles graph Frati et al.[2008]: There exist plane graphs with n vertices, n is a multiple of three, that takes area in any straight-line grid drawing. Frati et al.[2008]: There exist plane graphs with n vertices, n is a multiple of three, that takes ( 2n / 3 -1) ×( 2n / 3 ) area in any straight-line grid drawing. 18

19 Minimum-area grid drawings. Input plane 3-trees. We observe that there exist plane 3-trees with n ≥ 6 vertices that takes area in any straight-line grid drawing. ⌊ 2n / 3 -1 ⌋ × 2 ⌈ n / 3 ⌉ area in any straight-line grid drawing. CCCG 2010 August 11, 2010 Lower Bound on Area: Lower Bound on Area: ⌊ 2(n-1) / 3 ⌋ × ⌊ 2(n-1) / 3 ⌋  ⌊ 2n / 3 -1 ⌋ × 2 ⌈ n / 3 ⌉ When n is a multiple of three, this bound is the same as the one by Frati et al. 19

20 Future Works CCCG 2010 August 11, 2010 Devising a simpler algorithm to obtain minimum area drawings of plane 3-trees. Determining the minimum area drawings for the other plane graphs with bounded treewidth. Determining the area lower bound of straight-line grid drawings of planar 3-trees when the outer face is not fixed. 20

21 CCCG 2010 August 11, 2010

Download ppt "Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman and Md. Jawaherul Alam Graph Drawing and Information Visualization Laboratory Department of Computer."

Similar presentations

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 23 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Lower Bounds for Local Search by Quantum Arguments Scott Aaronson.

Lower Bounds for Local Search by Quantum Arguments Scott Aaronson.
Warm Up Example 1 Check whether the ordered pair is a solution of 2x – 3y > -2 a.(0,0) 2(0)-3(0)> -2 0> -2 True b.(0,1) 2(0)-3(1)> -2 -3> -2 False.

Warm Up Example 1 Check whether the ordered pair is a solution of 2x – 3y > -2 a.(0,0) 2(0)-3(0)> -2 0> -2 True b.(0,1) 2(0)-3(1)> -2 -3> -2 False.
Rahnuma Islam Nishat Debajyoti Mondal Md. Saidur Rahman Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering.

Rahnuma Islam Nishat Debajyoti Mondal Md. Saidur Rahman Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering.
Planar Graphs: Coloring and Drawing

Planar Graphs: Coloring and Drawing
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.

Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
Debajyoti Mondal Department of Computer Science University of Manitoba Department of Computer Science University of Colorado Denver Stephane Durocher Department.

Debajyoti Mondal Department of Computer Science University of Manitoba Department of Computer Science University of Colorado Denver Stephane Durocher Department.
GD 2011September 21, 2011 Stephane Durocher Debajyoti Mondal Md. Saidur Rahman Sue Whitesides Rahnuma Islam Nishat Dept. of Computer Science and Engg.

GD 2011September 21, 2011 Stephane Durocher Debajyoti Mondal Md. Saidur Rahman Sue Whitesides Rahnuma Islam Nishat Dept. of Computer Science and Engg.
Study on Power Domination of Graphs 圖上電力支配問題的研究 研究生：莊建成 指導教授：張鎮華 Student ： Chien-Cheng Chuang Advisor ： Gerard Jennhwa Chang Department of Mathematics,

Study on Power Domination of Graphs 圖上電力支配問題的研究 研究生：莊建成 指導教授：張鎮華 Student ： Chien-Cheng Chuang Advisor ： Gerard Jennhwa Chang Department of Mathematics,
CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov 05 2009.

CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov
Advanced Topics in Algorithms and Data Structures Lecture 7.1, page 1 An overview of lecture 7 An optimal parallel algorithm for the 2D convex hull problem,

Advanced Topics in Algorithms and Data Structures Lecture 7.1, page 1 An overview of lecture 7 An optimal parallel algorithm for the 2D convex hull problem,
1 Monotone Drawings of Graphs Thanks to Peter Eades www.dia.uniroma3.it/~compunet Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati,

1 Monotone Drawings of Graphs Thanks to Peter Eades Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati,
Stephane Durocher 1 Debajyoti Mondal 1 Rahnuma Islam Nishat 2 Sue Whitesides 2 1 Department of Computer Science, University of Manitoba 2 Department of.

Stephane Durocher 1 Debajyoti Mondal 1 Rahnuma Islam Nishat 2 Sue Whitesides 2 1 Department of Computer Science, University of Manitoba 2 Department of.
Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology.

Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology.
Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs Sudip Biswas Debajyoti Mondal Rahnuma Islam Nishat Md. Saidur Rahman Graph Drawing and.

Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs Sudip Biswas Debajyoti Mondal Rahnuma Islam Nishat Md. Saidur Rahman Graph Drawing and.
1 Debajyoti Mondal 2 Rahnuma Islam Nishat 2 Sue Whitesides 3 Md. Saidur Rahman 1 University of Manitoba, Canada 2 University of Victoria, Canada 3 Bangladesh.

1 Debajyoti Mondal 2 Rahnuma Islam Nishat 2 Sue Whitesides 3 Md. Saidur Rahman 1 University of Manitoba, Canada 2 University of Victoria, Canada 3 Bangladesh.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.

Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
16:36MCS - WG20041 On the Maximum Cardinality Search Lower Bound for Treewidth Hans Bodlaender Utrecht University Arie Koster ZIB Berlin.

16:36MCS - WG20041 On the Maximum Cardinality Search Lower Bound for Treewidth Hans Bodlaender Utrecht University Arie Koster ZIB Berlin.
WALCOM 2012February 16, 2012 Stephane Durocher Debajyoti Mondal Department of Computer Science University of Manitoba.

WALCOM 2012February 16, 2012 Stephane Durocher Debajyoti Mondal Department of Computer Science University of Manitoba.
Convex Grid Drawings of 3-Connected Plane Graphs Erik van de Pol.

Convex Grid Drawings of 3-Connected Plane Graphs Erik van de Pol.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

Similar presentations

Ads by Google