Straight line drawing of a graph on the flat torus Luca Castelli - - PowerPoint PPT Presentation

straight line drawing of a graph on the flat torus
SMART_READER_LITE
LIVE PREVIEW

Straight line drawing of a graph on the flat torus Luca Castelli - - PowerPoint PPT Presentation

Straight line drawing of a graph on the flat torus Luca Castelli Aleardi, LIX Olivier Devillers, INRIA Eric Fusy, LIX 1 Torus 2 Torus 2 Torus Flat torus 2 Torus Flat torus 2 Torus Flat torus 2 Torus Flat torus Graph 2


slide-1
SLIDE 1

1

Straight line drawing

  • n the flat torus
  • f a graph

Olivier Devillers, INRIA Luca Castelli Aleardi, LIX ´ Eric Fusy, LIX

slide-2
SLIDE 2

2

Torus

slide-3
SLIDE 3

2

Torus

slide-4
SLIDE 4

2

Torus Flat torus

slide-5
SLIDE 5

2

Torus Flat torus

slide-6
SLIDE 6

2

Torus Flat torus

slide-7
SLIDE 7

2

Torus Graph Flat torus

slide-8
SLIDE 8

2

Torus Graph

Convex straight line drawing

Problem statement

Flat torus

slide-9
SLIDE 9

3

Result

Given a map on a torus

slide-10
SLIDE 10

3

Result

Convex straight line drawing Given a map on a torus in rectangle O(n) × O(n

3 2 )

(essentially 3-connected)

Get a

slide-11
SLIDE 11

4

[De Fraysseix, Pach, & Pollack]

Planar straight line drawing Given a triangulation in rectangle O(n) × O(n) Get a

slide-12
SLIDE 12

5

Algorithm, global view Vertices ordering triangulation of a cylinder, no chords, no 2-cycles Incremental drawing (boudary characteristics) Split triangulation in pieces maps of a cylinder triangulation of a cylinder, with chords, 2-cycles & loops triangulation and maps of a torus Cut the torus → cylinder Different boudary characteristics

slide-13
SLIDE 13

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles

a k i j h b e

slide-14
SLIDE 14

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles Annular view / periodic view

a d c k i j h g f b a d a k i j h e f g

lower boundary

b e c a k i j h b e

slide-15
SLIDE 15

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles Annular view / periodic view

a d c k i j h g f b a d a k i j h e f g

lower boundary

b

no chords at lower boundary

e c

slide-16
SLIDE 16

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles Annular view / periodic view

a d c k i j h g f b a d a k i j h e f g

lower boundary

b

no 2-cycles

e c

slide-17
SLIDE 17

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles Shelling order

slide-18
SLIDE 18

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles 7 Remove vertices, so that the remaining part is an annulus

slide-19
SLIDE 19

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles 7 6

slide-20
SLIDE 20

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles 7 6 5

slide-21
SLIDE 21

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles 7 6 5 4

slide-22
SLIDE 22

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles 7 6 5 4 3

slide-23
SLIDE 23

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles 7 6 5 4 3 2

slide-24
SLIDE 24

6

Algorithm, vertices ordering triangulation of a cylinder, no chords, no 2-cycles 7 6 5 4 3 2

slide-25
SLIDE 25

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing

slide-26
SLIDE 26

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing slopes +1 or -1

slide-27
SLIDE 27

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing slopes +1 or -1

slide-28
SLIDE 28

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing slopes +1 or -1

slide-29
SLIDE 29

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing slopes +1 or -1

slide-30
SLIDE 30

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing

slide-31
SLIDE 31

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing |slopes| < 1

slide-32
SLIDE 32

7

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles incremental drawing |slopes| < 1

slide-33
SLIDE 33

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

slide-34
SLIDE 34

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

slide-35
SLIDE 35

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

1

slide-36
SLIDE 36

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

1 2

slide-37
SLIDE 37

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

1 2 3

slide-38
SLIDE 38

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

1 2 3 4

slide-39
SLIDE 39

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

5 4 2 1 3

slide-40
SLIDE 40

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

5 4 6 2 1 3

slide-41
SLIDE 41

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

5 4 6 1 3 7 2

slide-42
SLIDE 42

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

5 4 6 1 3 7

height ≤ 2n

2

slide-43
SLIDE 43

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

5 4 6 1 3 7

height ≤ 2n height ≤ 2n

2

slide-44
SLIDE 44

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

5 4 6 1 3 7

height ≤ 2n height ≤ 2n height ≤ 2n

2

slide-45
SLIDE 45

8

Algorithm, incremental drawing triangulation of a cylinder, no chords, no 2-cycles

5 4 6 1 3 7

height ≤ width ≤ 2n

2

2n × (c + 1)

slide-46
SLIDE 46

9

Algorithm, 2-cycles and loops

slide-47
SLIDE 47

9

Algorithm, 2-cycles and loops

slide-48
SLIDE 48

9

Algorithm, 2-cycles and loops loop 2-cycle

slide-49
SLIDE 49

9

Algorithm, 2-cycles and loops

slide-50
SLIDE 50

9

Algorithm, 2-cycles and loops

slide-51
SLIDE 51

9

Algorithm, 2-cycles and loops

slide-52
SLIDE 52

9

Algorithm, 2-cycles and loops

slide-53
SLIDE 53

10

Algorithm, chords

slide-54
SLIDE 54

10

Algorithm, chords

slide-55
SLIDE 55

10

Algorithm, chords chords

slide-56
SLIDE 56

10

Algorithm, chords

slide-57
SLIDE 57

10

Algorithm, chords

slide-58
SLIDE 58

11

Algorithm, maps slopes +1 or -1 or 0 several adaptations

slide-59
SLIDE 59

12

Algorithm, from cylinder to torus

slide-60
SLIDE 60

12

Algorithm, from cylinder to torus

slide-61
SLIDE 61

12

Algorithm, from cylinder to torus tambourine

slide-62
SLIDE 62

12

Algorithm, from cylinder to torus cylinder

slide-63
SLIDE 63

12

Algorithm, from cylinder to torus cylinder

slide-64
SLIDE 64

12

Algorithm, from cylinder to torus torus

slide-65
SLIDE 65

13

Given a map on a torus

slide-66
SLIDE 66

13

Convex straight line drawing Given a map on a torus

  • n grid 2n × (1 + 2n(c + 1))

(essentially 3-connected)

Get a c ≤ √2n