Presentation is loading. Please wait.

Presentation is loading. Please wait.

Drawing Plane Triangulations with Few Segments

Published byBernard George Modified over 6 years ago

Similar presentations

Presentation on theme: "Drawing Plane Triangulations with Few Segments"— Presentation transcript:

1 Drawing Plane Triangulations with Few Segments
Stephane Durocher Debajyoti Mondal Thank you session chair, I am going to present our paper entitled Drawing Plane Triangulations with Few Segments. This is a joint work with my supervisor dr. stephane durocher. And we are from University of Manitoba. Department of Computer Science University of Manitoba CCCG 2014 August 11, 2014

2 k-Segment Drawings a b c d e f g h i (a) a b (c) a b c d e f g h i i h
CCCG 2014 August 11, 2014

3 k-Segment Drawings a b c d e f g h i (a) a b (c) a b c d e f g h i i h g f e d c (b) a b i A segment is maximal path P such that the vertices on P are collinear in the drawing. h g f e d c CCCG 2014 August 11, 2014

4 k-Segment Drawings a b c d e f g h i (a) a b (c) a b c d e f g h i i h
A 10-segment drawing A 8-segment drawing CCCG 2014 August 11, 2014

5 k-Segment Drawings a b c d e f g h i (a) a b (c) a b c d e f g h i i h g f e d c (b) Minimization is NP-complete [Durocher, Mondal, Nishat, and Whitesides, CCCG 2011] A 10-segment drawing A 8-segment drawing CCCG 2014 August 11, 2014

6 Previous Results Graph Class Lower Bounds Upper Bounds References
Trees | {v: deg(v) is odd} | / 2 Dujmović, Eppstein, Suderman and Wood, CGTA 2007 Maximal Outerplanar n Plane 2-Trees and 3-Trees 2n 3-Connected Cubic Plane n/2+3 n/2+4 Mondal, Nishat, Biswas, and Rahman, JOCO 2010 3-Connected Plane 5n/2 (= 2.50n) Triangulations 7n/3 (= 2.33n) This Presentation 4-Conneted Triangulations X 9n/4 (= 2.25n) CCCG 2014 August 11, 2014

7 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a b f k g c i e l d j h Every rooted tree T has an upward drawing with leaf (T) segments. CCCG 2014 August 11, 2014

8 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a a b f k b g c i e l c d j h Every rooted tree T has an upward drawing with leaf (T) segments. CCCG 2014 August 11, 2014

9 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a a b f k b g c i e l c d j d h Every rooted tree T has an upward drawing with leaf (T) segments. CCCG 2014 August 11, 2014

10 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a a b f k b g c i e l c d j d h e Every rooted tree T has an upward drawing with leaf (T) segments. CCCG 2014 August 11, 2014

11 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a a b f k b f g c i g e l c d j d h h e Every rooted tree T has an upward drawing with leaf (T) segments. CCCG 2014 August 11, 2014

12 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a a b f k b f g c i l g e c d j d h h e i j Every rooted tree T has an upward drawing with leaf (T) segments. CCCG 2014 August 11, 2014

13 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a a b f k b f g c i l g e c k d j d h h e l i j Every rooted tree T has an upward drawing with leaf (T) segments. CCCG 2014 August 11, 2014

14 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a a b f k b f g c i l g e c k d j d h h e l i j Whenever we create a new segment, we ensure that this new segment starts at a non-leaf vertex T and ends at a leaf of T  The drawing has leaf (T) segments. CCCG 2014 August 11, 2014

15 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees a b c d e h f g i j k l a b c d h f g i j k l e Divergence: downward extension of the segments does not create edge crossings. Whenever we create a new segment, we ensure that this new segment starts at a non-leaf vertex T and ends at a leaf of T  The drawing has leaf (T) segments. CCCG 2014 August 11, 2014

16 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees v8 v3 v1 v2 v6 v7 G3 v5 v4 v5 v4 v4 v3 v1 v2 v3 v3 v1 v2 v1 v2 A Canonical Ordering of G [De Fraysseix, Pach, and Pollack 1988] G4 G5 v8 v6 v6 v7 v6 v7 v5 v5 v4 v4 v5 v4 v3 v3 v1 v2 v1 v2 v3 G6 G7 v1 v2 G8

17 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees v8 v3 v1 v2 v6 v7 G3 v5 v4 v5 v4 v4 v3 v1 v2 v3 v3 v1 v2 v1 v2 A Canonical Ordering of G [De Fraysseix, Pach, and Pollack 1988] G4 G5 v8 v6 v6 v7 v6 v7 v5 v5 v4 v4 v5 v4 v3 v3 v1 v2 v1 v2 v3 G6 G7 v1 v2 G8

18 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees v8 v8 v6 v6 v7 v7 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2 A Canonical Ordering of G [De Fraysseix et al. 1988] A Schnyder realizer of G [Schnyder 1990] v8 v8 v8 v6 v6 v6 v7 v7 v5 v5 v4 v5 v4 v4 v3 v3 v3 v2 v2 v1 v1 v2 v1

19 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees v8 v8 v6 v6 v7 v7 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2 A Canonical Ordering of G [De Fraysseix et al. 1988] A Schnyder realizer of G [Schnyder 1990] leaf (Tr) =3 v8 v8 v8 leaf (Tl) =3 v6 v6 v6 v7 v7 v7 v5 v5 v4 v5 v4 v4 v3 v3 v3 v2 v2 v1 v1 v2 v1 Tm

20 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 v7 v5 v4 v3 v1 v2 CCCG 2014 August 11, 2014

21 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 v7 v5 v4 v3 v1 v2 v3 v1 v2 Incremental construction in canonical order while maintaining nice drawings of the subtrees

22 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 v7 v5 v4 v3 v1 v2 v4 v3 v3 v1 v2 v1 v2 Incremental construction in canonical order while maintaining nice drawings of the subtrees

23 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 v7 v5 v4 v3 v1 v2 v5 v4 v4 v3 v3 v1 v2 v1 v2 Incremental construction in canonical order while maintaining nice drawings of the subtrees

24 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 v7 v5 v4 v3 v1 v2 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2 Incremental construction in canonical order while maintaining nice drawings of the subtrees

25 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 v7 v5 v4 v3 v1 v2 v6 v7 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2 Incremental construction in canonical order while maintaining nice drawings of the subtrees

26 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 v7 leaf (Tl) + leaf (Tr) + 3 segments v5 v4 v8 v3 v1 v2 v7 v6 v7 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2 Incremental construction in canonical order while maintaining nice drawings of the subtrees

27 Better Upper Bound for Triangulations
Idea: Nice Drawings of Trees + Decomposition of a Triangulation into Trees Draw G with at most leaf (Tl) + leaf (Tr) + n segments v8 v6 leaf (Tl) + leaf (Tr) + 3 segments + at most (n-3) segments v7 v5 v4 v8 v3 v1 v2 v7 v6 v7 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2 Incremental construction in canonical order while maintaining nice drawings of the subtrees

28 Why Does this Work? v8 v8 v6 v7 v7 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2
A triangulation G and A drawing of G with at most leaf (Tl) + leaf (Tr) + n segments Question 1. What makes it possible to maintain nice drawings of the subtrees? - We can always create a new segment satisfying the ‘divergence’ property. v p q CCCG 2014 August 11, 2014

29 Why Does this Work? v8 v8 v6 v7 v7 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2
A triangulation G and A drawing of G with at most leaf (Tl) + leaf (Tr) + n segments Question 1. What makes it possible to maintain nice drawings of the subtrees? - We can always create a new segment satisfying the ‘divergence’ property. v p q p q CCCG 2014 August 11, 2014

30 Why Does this Work? v8 v8 v6 v7 v7 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2
A triangulation G and A drawing of G with at most leaf (Tl) + leaf (Tr) + n segments Question 2. Why the drawing of the edges in Tm does not create any edge crossing? - The slopes of the l-edges incident to the outerface are smaller than the slope of edge (v, p). - The slopes of the r-edges incident to the outerface are larger than the slope of edge (v, q). v v p q p q

31 Final Upper Bounds Combine the upper bounds on the number of leaves
Graph Class Lower Bounds Upper Bounds References Trees | {v: deg(v) is odd} | / 2 Dujmović, Eppstein, Suderman and Wood, CGTA 2007 Maximal Outerplanar n Plane 2-Trees and 3-Trees 2n Samee, Alam, Adnan and Rahman, GD 2008 3-Connected Cubic Plane Graphs n/2 Mondal, Nishat, Biswas, and Rahman, JOCO 2010 3-Connected 5n/2 (= 2.50n) Triangulations leaf (Tl) + leaf (Tr) + n <= 2.33n This Presentation 4-Conneted Triangulations X leaf (Tl) + leaf (Tr) + n <= 2.25n Combine the upper bounds on the number of leaves [Bonichon, Saëc and Mosbah, ICALP 2002] [Zhang and He, DCG 2005] CCCG 2014 August 11, 2014

32 Future Research Tight Bounds: What is the smallest constant c such that every n vertex planar graph admits a (cn)-segment drawing? Can we improve the bound in the variable embedding setting? Generalization: Does the upper bound of 7n/3 segments hold also for 3-connected planar graphs? Optimization: Is there a polynomial-time algorithm for computing minimum-segment drawings of triangulations, or simpler classes of graphs such as plane 3-trees or outerplanar graphs? CCCG 2014 August 11, 2014

33 Thank You.. v8 v8 v6 v7 v7 v6 v5 v5 v4 v4 v3 v3 v1 v2 v1 v2 a b c d h
f g i j k l e Thank You.. Tight Bounds? Generalization? Optimization?

Download ppt "Drawing Plane Triangulations with Few Segments"

Similar presentations

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
Minimum Vertex Cover in Rectangle Graphs

Minimum Vertex Cover in Rectangle Graphs
22nd International Symposium on Graph Drawing

22nd International Symposium on Graph 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.
More Efficient Generation of Plane Triangulations Shin-ichi Nakano Takeaki Uno Gunma University National Institute of JAPAN Informatics, JAPAN 23/Sep/2003.

More Efficient Generation of Plane Triangulations Shin-ichi Nakano Takeaki Uno Gunma University National Institute of JAPAN Informatics, JAPAN 23/Sep/2003.
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.
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs Chenyu Yan, Yang Xiang, and Feodor F. Dragan (WADS 2009) Kent State University, Kent,

Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs Chenyu Yan, Yang Xiang, and Feodor F. Dragan (WADS 2009) Kent State University, Kent,
Spine Crossing Minimization in Upward Topological Book Embeddings Tamara Mchedlidze, Antonios Symvonis Department of Mathematics, National Technical University.

Spine Crossing Minimization in Upward Topological Book Embeddings Tamara Mchedlidze, Antonios Symvonis Department of Mathematics, National Technical University.
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.
Krakow, Summer 2011 Schnyder’s Theorem and Relatives William T. Trotter

Krakow, Summer 2011 Schnyder’s Theorem and Relatives William T. Trotter
Seminar Graph Drawing H.1 - 3.2: Introduction to Graph Drawing Jesper Nederlof Roeland Luitwieler.

Seminar Graph Drawing H : Introduction to Graph Drawing Jesper Nederlof Roeland Luitwieler.
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,
Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman and Md. Jawaherul Alam Graph Drawing and Information Visualization Laboratory Department of Computer.

Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman and Md. Jawaherul Alam Graph Drawing and Information Visualization Laboratory Department of Computer.
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.
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.
Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.

Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.

Similar presentations

Ads by Google