The Art Gallery Theorem Vic Reiner, Univ. of Minnesota St. Johns - - PowerPoint PPT Presentation

the art gallery theorem
SMART_READER_LITE
LIVE PREVIEW

The Art Gallery Theorem Vic Reiner, Univ. of Minnesota St. Johns - - PowerPoint PPT Presentation

Outline The players The theorem The proof from THE BOOK Variations The Art Gallery Theorem Vic Reiner, Univ. of Minnesota St. Johns University Sept. 15, 2015 Vic Reiner, Univ. of Minnesota The Art Gallery Theorem Outline The players


slide-1
SLIDE 1

Outline The players The theorem The proof from THE BOOK Variations

The Art Gallery Theorem

Vic Reiner, Univ. of Minnesota

  • St. John’s University
  • Sept. 15, 2015

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-2
SLIDE 2

Outline The players The theorem The proof from THE BOOK Variations

1

The players

2

The theorem

3

The proof from THE BOOK

4

Variations

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-3
SLIDE 3

Outline The players The theorem The proof from THE BOOK Variations

The one who asked the question: Victor Klee

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-4
SLIDE 4

Outline The players The theorem The proof from THE BOOK Variations

Klee’s question posed to V. Chvátal

Given the floor plan of a weirdly shaped art gallery having N straight sides, how many guards will we need to post, in the worst case, so that every bit of wall is visible to a guard? Can one do it with N/3 guards?

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-5
SLIDE 5

Outline The players The theorem The proof from THE BOOK Variations

Klee’s question posed to V. Chvátal

Given the floor plan of a weirdly shaped art gallery having N straight sides, how many guards will we need to post, in the worst case, so that every bit of wall is visible to a guard? Can one do it with N/3 guards?

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-6
SLIDE 6

Outline The players The theorem The proof from THE BOOK Variations

Vasek Chvátal: Yes, I can prove that!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-7
SLIDE 7

Outline The players The theorem The proof from THE BOOK Variations

Steve Fisk: OK, but I have a proof from THE BOOK!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-8
SLIDE 8

Outline The players The theorem The proof from THE BOOK Variations

Our weirdly-shaped art museum: The Weisman

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-9
SLIDE 9

Outline The players The theorem The proof from THE BOOK Variations

The floor plan

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-10
SLIDE 10

Outline The players The theorem The proof from THE BOOK Variations

They can get crazier!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-11
SLIDE 11

Outline The players The theorem The proof from THE BOOK Variations

Enough fooling around– let’s understand Klee’s question!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-12
SLIDE 12

Outline The players The theorem The proof from THE BOOK Variations

A convex gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-13
SLIDE 13

Outline The players The theorem The proof from THE BOOK Variations

A convex gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-14
SLIDE 14

Outline The players The theorem The proof from THE BOOK Variations

A star-shaped gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-15
SLIDE 15

Outline The players The theorem The proof from THE BOOK Variations

A star-shaped gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-16
SLIDE 16

Outline The players The theorem The proof from THE BOOK Variations

A 4-sided gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-17
SLIDE 17

Outline The players The theorem The proof from THE BOOK Variations

A 4-sided gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-18
SLIDE 18

Outline The players The theorem The proof from THE BOOK Variations

A 5-sided gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-19
SLIDE 19

Outline The players The theorem The proof from THE BOOK Variations

A 5-sided gallery needs only one guard

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-20
SLIDE 20

Outline The players The theorem The proof from THE BOOK Variations

A 6-sided gallery might need two guards

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-21
SLIDE 21

Outline The players The theorem The proof from THE BOOK Variations

N-sided galleries might need N/3 guards: the comb

N = 21 N/3 = 7 Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-22
SLIDE 22

Outline The players The theorem The proof from THE BOOK Variations

Klee’s question for Chvátal

Question (V. Klee, 1973) How many guards does an N-sided gallery need? Is the comb the worst case? Theorem (V. Chvátal, 1973, shortly thereafter) Yes, the combs achieve the worst case: every N-sided gallery needs at most N/3 guards. (Of course, you can still have star-shaped galleries with a huge number of sides N, but they’ll only need one guard.)

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-23
SLIDE 23

Outline The players The theorem The proof from THE BOOK Variations

Klee’s question for Chvátal

Question (V. Klee, 1973) How many guards does an N-sided gallery need? Is the comb the worst case? Theorem (V. Chvátal, 1973, shortly thereafter) Yes, the combs achieve the worst case: every N-sided gallery needs at most N/3 guards. (Of course, you can still have star-shaped galleries with a huge number of sides N, but they’ll only need one guard.)

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-24
SLIDE 24

Outline The players The theorem The proof from THE BOOK Variations

What if N isn’t divisible by 3?

N = 22 N/3 = 7 1/3 Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-25
SLIDE 25

Outline The players The theorem The proof from THE BOOK Variations

Steve Fisk’s wonderful 1978 proof appears in this book

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-26
SLIDE 26

Outline The players The theorem The proof from THE BOOK Variations

... by Gunter Ziegler ...

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-27
SLIDE 27

Outline The players The theorem The proof from THE BOOK Variations

... and Martin Aigner

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-28
SLIDE 28

Outline The players The theorem The proof from THE BOOK Variations

... aided and inspired by Paul Erd˝

  • s

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-29
SLIDE 29

Outline The players The theorem The proof from THE BOOK Variations

Guess which museum appears on page 231?

How to guard a museum Chapter 35

Here is an appealing problem which was raised by Victor Klee in 1973. Suppose the manager of a museum wants to make sure that at all times every point of the museum is watched by a guard. The guards are stationed at fixed posts, but they are able to turn around. How many guards are needed? We picture the walls of the museum as a polygon consisting of n sides. Of course, if the polygon is convex, then one guard is enough. In fact, the guard may be stationed at any point of the museum. But, in general, the A convex exhibition hall walls of the museum may have the shape of any closed polygon. Consider a comb-shaped museum with n = 3m walls, as depicted on the

  • right. It is easy to see that this requires at least m = n

3 guards. In fact,

. . . 2 3 . . . m 1 there are n walls. Now notice that the point 1 can only be observed by a guard stationed in the shaded triangle containing 1, and similarly for the

  • ther points 2, 3, . . . , m. Since all these triangles are disjoint we conclude

that at least m guards are needed. But m guards are also enough, since they can be placed at the top lines of the triangles. By cutting off one or two walls at the end, we conclude that for any n there is an n-walled museum which requires ⌊ n

3 ⌋ guards.

A real life art gallery. . .

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-30
SLIDE 30

Outline The players The theorem The proof from THE BOOK Variations

Fisk’s proof from THE BOOK that N/3 guards suffice

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-31
SLIDE 31

Outline The players The theorem The proof from THE BOOK Variations

First triangulate the gallery without new vertices

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-32
SLIDE 32

Outline The players The theorem The proof from THE BOOK Variations

Then properly 3-color its vertices

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-33
SLIDE 33

Outline The players The theorem The proof from THE BOOK Variations

The least popular color gets used at most N/3 times

N=19 sides, so 19 vertices. 6 red, 7 blue, 6 yellow vertices Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-34
SLIDE 34

Outline The players The theorem The proof from THE BOOK Variations

Post guards near the least popular color vertices

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-35
SLIDE 35

Outline The players The theorem The proof from THE BOOK Variations

How to triangulate without new vertices? Induct!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-36
SLIDE 36

Outline The players The theorem The proof from THE BOOK Variations

How to triangulate without new vertices? Induct!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-37
SLIDE 37

Outline The players The theorem The proof from THE BOOK Variations

How to 3-color the vertices? Induct!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-38
SLIDE 38

Outline The players The theorem The proof from THE BOOK Variations

One can always glue the colorings back together

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-39
SLIDE 39

Outline The players The theorem The proof from THE BOOK Variations

How to get the red dividing line to start inducting? The flashlight argument!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-40
SLIDE 40

Outline The players The theorem The proof from THE BOOK Variations

The flashlight argument

Starting at a vertex X, shine a flashlight along the wall to an adjacent vertex Y, and swing it in an arc until you first hit another vertex Z. Then either XZ or YZ works as the red dividing line.

X Y Z

X Y Z

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-41
SLIDE 41

Outline The players The theorem The proof from THE BOOK Variations

How good is Fisk’s method for convex galleries?

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-42
SLIDE 42

Outline The players The theorem The proof from THE BOOK Variations

It depends on the triangulation

OK Better Best! Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-43
SLIDE 43

Outline The players The theorem The proof from THE BOOK Variations

A couple of variations one might wonder about

Three dimensional galleries? Only right-angled walls in two dimensions?

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-44
SLIDE 44

Outline The players The theorem The proof from THE BOOK Variations

3D explains why we worried about how to triangulate!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-45
SLIDE 45

Outline The players The theorem The proof from THE BOOK Variations

Schoenhardt’s (1928) untriangulable sphere in 3D!

It has no interior tetrahedra that can be formed by any four out of its six vertices!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-46
SLIDE 46

Outline The players The theorem The proof from THE BOOK Variations

Even worse: Seidel’s (1987) Octoplex

Its center point is visible from none of the vertices! Existence of such examples makes the 3-D theory harder.

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-47
SLIDE 47

Outline The players The theorem The proof from THE BOOK Variations

What about when the walls meet only at right angles?

  • J. Kahn, M. Klawe, and D. Kleitman proved this result in a 1983

paper titled “Traditional galleries require fewer watchmen” Theorem For right-angled galleries with N sides, N/4 guards suffice. One might guess how they feel about the Weisman Museum.

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-48
SLIDE 48

Outline The players The theorem The proof from THE BOOK Variations

Right-angled combs again achieve the worst case

N=20 sides N/4 = 5 guards Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-49
SLIDE 49

Outline The players The theorem The proof from THE BOOK Variations

Does the Art Gallery Theorem have real applications?

Not directly that I know. But related ideas from the areas of discrete geometry and combinatorics get used in designing algorithms for searching terrains, robot-motion planning, motorized vacuum cleaners (!)

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-50
SLIDE 50

Outline The players The theorem The proof from THE BOOK Variations

The set of triangulations of a polygon is interesting!

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-51
SLIDE 51

Outline The players The theorem The proof from THE BOOK Variations

A polyhedron beloved to me: the associahedron

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem

slide-52
SLIDE 52

Outline The players The theorem The proof from THE BOOK Variations

Thanks for listening!

Bibliography T.S. Michael’s

article: “Guards, Galleries, Fortresses, and the Octoplex” (College Math. Journal 42, no. 3, March 2011, pp.191-200) book: “How to Guard an Art Gallery and Other Discrete Mathematical Adventures”.

Norman Do’s “Mathellaneous” article on Art Gallery Theorems, (Australian Math. Soc. Gazette, Nov. 2004). Art Gallery Theorems, by J. O’Rourke Proofs from THE BOOK, by M. Aigner and G. Ziegler Triangulations: Structures for algorithms and applications, by J. De Loera, J. Rambau and F . Santos.

Vic Reiner, Univ. of Minnesota The Art Gallery Theorem