Download presentation

Presentation is loading. Please wait.

Published byCatherine Comerford Modified over 3 years ago

1
GD 2011September 21, 2011 Stephane Durocher Debajyoti Mondal Md. Saidur Rahman Sue Whitesides Rahnuma Islam Nishat Dept. of Computer Science and Engg. Bangladesh University of Engineering and Technology Department of Computer Science University of Victoria Department of Computer Science University of Manitoba

2
GD 2011September 21, 2011 a b c d e f g h i A plane graph G A point set P 1

3
GD 2011September 21, 2011 a b c d e f g h i A plane graph G An embedding of G on P a b c d e f g h i 2

4
GD 2011September 21, 2011 Gritzmann et al. (1991), Castañeda and Urrutia (1996) Outerplanar graphsO(n 2 ) Bose (2002)Outerplanar graphsO(n lg 3 n) Cabello (2006)Biconnected 2-outerplanar graphs NP-complete Nishat et al. (2010) Plane 3-trees Partial plane 3-trees O(n 2 ), NP-complete Moosa et al. (2011) Plane 3-trees O(n 4/3 + ɛ log n) This Presentation Reference Graph Class Time complexity 3

5
GD 2011September 21, 2011 a b c d e f g h i j k l m n o A plane 3-tree G f g h i j k l m n o a b c d e A construction for G 4

6
GD 2011September 21, 2011 a b c d e f g h i j k l m n o A plane 3-tree G f g h i j k l m n o a b c d e The representative vertex of G k l e A plane 3-tree A construction for G c o c g m n d A plane 3-tree 5

7
GD 2011September 21, 2011 a b c d e Convex Hull f g h A plane 3-tree G A point set P 6

8
GD 2011September 21, 2011 b c d e a c b a f g h A plane 3-tree G A point set P We can map the outervertices in Six different ways. 7

9
GD 2011September 21, 2011 d b c d e a a c b 0 0 3 3 1 1 Find a valid mapping for the representative vertex. f g h Valid mapping?? a b c d e f g h n 1 = 1 n 2 = 1 n 3 = 2 8

10
GD 2011September 21, 2011 a c b d 1 1 1 1 2 2 Find a valid mapping for the representative vertex. b c d e a f g h a b c d e f g h n 1 = 1 n 2 = 1 n 3 = 2 9

11
GD 2011September 21, 2011 b c d e a a c b d f g h e h f g Find a valid mapping for the representative vertex recursively. a b c d e f g h 10

12
GD 2011September 21, 2011 How fast can we find a valid mapping for the representative vertex, if such a mapping exists? 11

13
GD 2011September 21, 2011 b c d e a c Representative vertex cannot be mapped in the shaded regions. At most min{n 1, n 2, n 3 }+1 points in the white region are candidates. Representative vertex cannot be mapped in the shaded regions. At most min{n 1, n 2, n 3 }+1 points in the white region are candidates. f g h a b c d e f g h Assume that n 1 ≤ min{n 2,n 3 }. a n 3 = 2 n 2 = 1 b n 1 = 1 n 2 = 1 n 3 = 2 12

14
GD 2011September 21, 2011 a b c d e a c b f g h a b c d e f g h z Choose a random point z Δ abc We need n 3 points in this region Choose a random point z Δ abc We need n 3 points in this region How do we select the shaded regions? n 1 = 1 n 2 = 1 n 3 = 2 13

15
GD 2011September 21, 2011 a b c d e a c b f g h a b c d e f g h How do we select the shaded regions? z Choose a random point z Δ abc We need n 3 points in this region Choose a random point z Δ abc We need n 3 points in this region n 1 = 1 n 2 = 1 n 3 = 2 14

16
GD 2011September 21, 2011 How do we select the shaded regions? b c d e a f g h a b c d e f g h c a b n 3 = 2 n 2 = 1 n 1 = 1 n 2 = 1 n 3 = 2 Selecting the shaded regions takes O(t n log n) expected time. At most min{n 1, n 2, n 3 }+1 points in the white region are candidates. Selecting the shaded regions takes O(t n log n) expected time. At most min{n 1, n 2, n 3 }+1 points in the white region are candidates. 15

17
GD 2011September 21, 2011 a c b d 1 1 1 1 2 2 Find a valid mapping in f n = O(t n log n) + O(t n min{n 1, n 2, n 3 }) time. T(n) = T(n 1 )+ T(n 2 )+ T(n 3 )+ f n = O(n 4/3 + ɛ ), for any ɛ > 0, using Chazelle’s DS. Find a valid mapping in f n = O(t n log n) + O(t n min{n 1, n 2, n 3 }) time. T(n) = T(n 1 )+ T(n 2 )+ T(n 3 )+ f n = O(n 4/3 + ɛ ), for any ɛ > 0, using Chazelle’s DS. b c d e a f g h a b c d e f g h n 1 = 1 n 2 = 1 n 3 = 2

18
GD 2011September 21, 2011 b c d e a c b a f g h A plane 3-tree G A point set P and a prespecified mapping for the outervertices of G 16

19
GD 2011September 21, 2011 Instance: A set of 3m nonzero positive integers S = {a 1, a 2,...,a 3m } and an integer B > 0, where a 1 +a 2 +...+a 3m = mB and B/4 0, where a 1 +a 2 +...+a 3m = mB and B/4
{
"@context": "http://schema.org",
"@type": "ImageObject",
"contentUrl": "http://images.slideplayer.com/13/4047442/slides/slide_19.jpg",
"name": "GD 2011September 21, 2011 Instance: A set of 3m nonzero positive integers S = {a 1, a 2,...,a 3m } and an integer B > 0, where a 1 +a 2 +...+a 3m = mB and B/4 0, where a 1 +a 2 +...+a 3m = mB and B/4

20
GD 2011September 21, 2011 a1a1 a2a2 a3ma3m B B Y b c Z X a b c a 18 G P

21
GD 2011September 21, 2011 S = {9, 10, 14, 12, 10, 9, 12, 11, 9, 10, 11, 11 }, B = 32 S 1 ={10, 10, 12}, S 2 ={ 9, 11, 12}, S 3 ={ 9, 9,14}, S 4 ={ 10, 11,11} Example: BB B B 19 x

22
GD 2011September 21, 2011 S = {9, 10, 14, 12, 10, 9, 12, 11, 9, 10, 11, 11 }, B = 32 S 1 ={10, 10, 12}, S 2 ={ 9, 11, 12}, S 3 ={ 9, 9,14}, S 4 ={ 10, 11,11} Example: BB B B 9 10 11 a1 a1 a2 a2 a|S| a|S| A fan A divider 20 x

23
GD 2011September 21, 2011 S = {9, 10, 14, 12, 10, 9, 12, 11, 9, 10, 11, 11 }, B = 32 S 1 ={10, 10, 12}, S 2 ={ 9, 11, 12}, S 3 ={ 9, 9,14}, S 4 ={ 10, 11,11} Example: 20 x {10, 10, 12} { 9, 11, 12} { 9, 9,14} { 10, 11,11}

24
GD 2011September 21, 2011 a1a1 a2a2 a3ma3m B B Y b c Z X a b c a 21 G P

25
GD 2011September 21, 2011 B B b c b c a A fan A divider a A spine vertex A spine vertex 22 G P

26
GD 2011September 21, 2011 B B b c b c a A fan A divider a A spine vertex A spine vertex 23 G P

27
b GD 2011September 21, 2011 B B c b c a Edge Crossings? Edge Crossings? a 24 A spine vertex A spine vertex A fan A divider G P

28
GD 2011September 21, 2011 25

29
GD 2011September 21, 2011 Dept. of Computer Science and Engg. Bangladesh University of Engineering and Technology Department of Computer Science University of Victoria Department of Computer Science University of Manitoba

Similar presentations

OK

UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 O’Rourke Chapter 8 Motion Planning.

UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 O’Rourke Chapter 8 Motion Planning.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Free ppt on balanced diet Ppt on information technology in india Ppt on changing role of teachers Ppt on etiquettes of life Ppt on time management for school students Ppt on food inflation in india Ppt on festivals of punjab Ppt on alternative communication system during disaster Ppt on voice operated intelligent fire extinguisher Free ppt on types of houses