Empty Rainbow Triangles in k -colored Point Sets Ruy Fabila-Monroy, - - PowerPoint PPT Presentation

empty rainbow triangles in k colored point sets
SMART_READER_LITE
LIVE PREVIEW

Empty Rainbow Triangles in k -colored Point Sets Ruy Fabila-Monroy, - - PowerPoint PPT Presentation

Empty Rainbow Triangles in k -colored Point Sets Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo CINVESTAV, MX and TU Graz, AT EuroCG2020 TU Graz 1 Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k -colored


slide-1
SLIDE 1

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

1

Empty Rainbow Triangles in k-colored Point Sets

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo

CINVESTAV, MX and TU Graz, AT

EuroCG2020 TU

Graz

slide-2
SLIDE 2

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

2 i

Introduction

Empty triangle: triangle with no point inside Not empty Point set in general position Empty triangle

slide-3
SLIDE 3

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

2 ii

Introduction

k-colored point set: k colors in total For every color there are m points with this color.

slide-4
SLIDE 4

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

2 iii

Introduction

Rainbow triangle, but not empty Empty rainbow triangle Not a rainbow triangle Rainbow triangle: triangle, where all three vertices have different colors.

slide-5
SLIDE 5

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

2 iv

Introduction

How many empty rainbow triangles are at least in a k-colored point set with n points? All empty rainbow triangles incident to v v

slide-6
SLIDE 6

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

3 i

Lower Bound

How many empty rainbow triangles are at least in a k-colored point set with n points? ⊲ Take an arbitrary point x. ⊲ Count triangles where x is the rightmost point. ⊲ Sum over all points. ⊲ Happiness

slide-7
SLIDE 7

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

3 ii

Lower Bound

p1 p2 p3 Label the colors from 1 to k by their leftmost points. In the 4-colored point set below we have blue as color 1, red as color 2, green as color 3 and black as color 4. p4

slide-8
SLIDE 8

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

3 iii

Lower Bound

p1 p2 p3 q2 q3 Label points of color i from left to right with q1 up to qk. Count rainbow triangles with qj as rightmost point. p4 = q1

slide-9
SLIDE 9

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

3 iv

Lower Bound

p1 p2 p3 q2 q3 Look at points to the left of qj in angular order. There are at least i − 1 other colors, so at least i − 2 times two points with different colors are neighbored. This gives i − 2 rainbow triangles. j − 1 points with color i could lie in these i − 2 triangles.

slide-10
SLIDE 10

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

3 v

Lower Bound

p1 p2 p3 q2 q3 At least i − j − 1 empty rainbow triangles with qj of color i as rightmost point. Summing over all i and j gives 1

6k3 − 1 2k2 + 1 3k.

slide-11
SLIDE 11

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

4 i

Upper bound

Main ideas: ⊲ Take a point set on k points with few empty triangles ⊲ Replace each point with a cluster of same colored points ⊲ Have few points for each color that are part of an empty rainbow triangle.

slide-12
SLIDE 12

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

4 ii

Upper bound

Main ideas: ⊲ Take a point set on k points with few empty triangles ⊲ Replace each point with a cluster of same colored points ⊲ Have few points for each color that are part of an empty rainbow triangle.

slide-13
SLIDE 13

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

4 iii

Upper bound

Main ideas: ⊲ Take a point set on k points with few empty triangles ⊲ Replace each point with a cluster of same colored points ⊲ Have few points for each color that are part of an empty rainbow triangle.

slide-14
SLIDE 14

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

5 i

Horton set

H = H0 ∪ H1 where H0, H1 are Horton sets, H1 is high above H0 and H0 is far below H1.

slide-15
SLIDE 15

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

5 ii

Horton set

H = H0 ∪ H1 where H0, H1 are Horton sets, H1 is high above H0 and H0 is far below H1. H0 H1

slide-16
SLIDE 16

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

5 iii

Horton set

H = H0 ∪ H1 where H0, H1 are Horton sets, H1 is high above H0 and H0 is far below H1. H0 H1

slide-17
SLIDE 17

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

5 iv

Horton set

Let s be a 01-string, H∅ = H a Horton set on k points. Hs = Hs0 ∪ Hs1, Hs1 high above Hs0, Hs0 far below Hs1. H10 H11 H0 H1 H101 H100

slide-18
SLIDE 18

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

5 v

Horton set

Number of points in Hs: k/2|s| 2k/2|s|+1 choices for such an edge k/2|s|+1 choices for point k2/2|s| empty triangles in Hs, not in Hs0 or Hs1. Hs0 Hs1

slide-19
SLIDE 19

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 i

Colored point set

Idea: Take a Horton set on k points and replace each point with a cluster of same colored points.

slide-20
SLIDE 20

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 ii

Colored point set

Construction of cluster: Every cluster is small and behaves like a point. p2 p1 p3 p4 p5 p6 p7 p8

slide-21
SLIDE 21

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 iii

Colored point set

p2 p1 q1 H0 H1 p3 p4 p5 p6 p7 p8 Order points in angular order around pi. Place a point q1 between the last point of H0 and the first point of H1 with distance ε1 from pi.

slide-22
SLIDE 22

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 iv

Colored point set

p2 p1 q1 H0 H1 p3 p4 p5 p6 p7 p8 Place a point q2 between the first point of H0 and the last point of H1 with distance ε2 from pi, where ε2 is much smaller than ε1. q2

slide-23
SLIDE 23

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 v

Colored point set

p2 p1 p3 p4 p5 p6 p7 p8 Continue in the same way and place new points closer to pi than the points before. q3 q1 q2 = q4 H00 H01

slide-24
SLIDE 24

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 vi

Colored point set

p2 p1 p3 p4 p5 p6 p7 p8 q1 q3 q2 = q4 Place points in every angle, which does not contain a point of the cluster.

slide-25
SLIDE 25

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 vii

Colored point set

p2 p1 p3 p4 p5 p6 p7 p8 p5 q1 q2 = q4 q3 Place the remaining points sufficiently close to pi. Only the first k added points can be in an empty rainbow triangle.

slide-26
SLIDE 26

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 viii

Colored point set

How many such triangles exist? k choices 2|s| choices 2|s| choices For an empty triangle in Hs there are 4|s|2k empty rainbow triangles in colored point set.

slide-27
SLIDE 27

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

6 ix

Colored point set

At most 8(k2/22|s|) empty triangles in Hs. For every such triangle, we have at most 4|s|2k rainbow triangles in P.

  • |s|≤log2(k) 8(k2/22|s|)(4|s|2k) = 192k3 + O(k2)
slide-28
SLIDE 28

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

7 i

Empty rainbow quadrilaterals

Does there always exist an empty rainbow quadrilateral? The quadrilateral can be convex or concave. not rainbow empty rainbow quadrilaterals Empty and rainbow like with triangles.

slide-29
SLIDE 29

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

7 ii

Empty rainbow quadrilaterals

C1 C3 C2 C4 C5 p′

2

p′

3

p′

4

p′

5

p′

1

Does there always exist an empty rainbow quadrilateral? Points set contains the clusters C1, C2, C3, C4, C5 and the red points.

slide-30
SLIDE 30

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

7 iii

Empty rainbow quadrilaterals

C1 C3 C2 C4 C5 Does there always exist an empty rainbow quadrilateral? Not empty

slide-31
SLIDE 31

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

7 iv

Empty rainbow quadrilaterals

C1 C3 C2 C4 C5 Does there always exist an empty rainbow quadrilateral? Not empty

slide-32
SLIDE 32

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

7 v

Empty rainbow quadrilaterals

C1 C3 C2 C4 C5 Does there always exist an empty rainbow quadrilateral? No Not empty

slide-33
SLIDE 33

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo Empty Rainbow Triangles in k-colored Point Sets

8

Summary and open problems

Number of empty rainbow triangles in a k-colored point set: Θ(k3), for n ≥ k2. Problem 1: What happens if n < k2? Problem 2: Does every sufficiently large k-colored (k ≥ 4) point set with the same number of points in each color class contain an empty rainbow 4-gon or an empty monochromatic 4-gon? There exist point sets without empty rainbow quadrilaterals.