Centerpoints Theory Lunch Talk
-
Upload
don-sheehy -
Category
Technology
-
view
212 -
download
1
description
Transcript of Centerpoints Theory Lunch Talk
![Page 1: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/1.jpg)
Searching for the center.
Don SheehyCMU Theory Lunch
October 8, 2008
1
![Page 2: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/2.jpg)
2
![Page 3: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/3.jpg)
It’s a fine line between stupid and
clever.
3
![Page 4: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/4.jpg)
The Divide and Conquer Game
4
![Page 5: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/5.jpg)
The Divide and Conquer Game
How to win
5
![Page 6: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/6.jpg)
The Divide and Conquer Game
How to win
Pick a center point.
6
![Page 7: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/7.jpg)
The Divide and Conquer Game
How to win
Pick a center point.
Given a set S ! Rd, a center point p is a pointsuch that every closed halfspace with p on itsboundary contains at least n
d+1points of S.
7
![Page 8: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/8.jpg)
Some definitions you probably already know.
8
![Page 9: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/9.jpg)
!
pi!P
cipiLinear:
9
![Page 10: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/10.jpg)
!
pi!P
cipiLinear:
Nonnegative: ci ! 0
10
![Page 11: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/11.jpg)
!
pi!P
cipiLinear:
Nonnegative:
Affine:
ci ! 0
!ci = 1
11
![Page 12: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/12.jpg)
!
pi!P
cipiLinear:
Nonnegative:
Affine:
Convex: Affine and Nonnegative
ci ! 0
!ci = 1
12
![Page 13: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/13.jpg)
Radon => Helly => Center Points Exist.
13
![Page 14: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/14.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
14
![Page 15: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/15.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
15
![Page 16: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/16.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
16
![Page 17: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/17.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
17
![Page 18: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/18.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
18
![Page 19: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/19.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
19
![Page 20: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/20.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
20
![Page 21: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/21.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
21
![Page 22: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/22.jpg)
Radon’s TheoremIf P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)
such that conv(U) " conv(U) is nonempty.
22
![Page 23: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/23.jpg)
Radon’s Theorem
d+2!
i=1
cipi = 0
d+2!
i=1
ci = 0
If P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)such that conv(U) " conv(U) is nonempty.
23
![Page 24: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/24.jpg)
Radon’s Theorem
d+2!
i=1
cipi = 0
d+2!
i=1
ci = 0
I+
= {i : ci > 0}
I!
= {i : ci < 0}
!
i!I+
cipi =!
i!I!
(!ci)pi
If P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)such that conv(U) " conv(U) is nonempty.
24
![Page 25: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/25.jpg)
Radon’s Theorem
d+2!
i=1
cipi = 0
d+2!
i=1
ci = 0
I+
= {i : ci > 0}
I!
= {i : ci < 0}
!
i!I+
cipi =!
i!I!
(!ci)pi
!
i!I+
ci =!
i!I!
(!ci)
If P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)such that conv(U) " conv(U) is nonempty.
25
![Page 26: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/26.jpg)
Radon’s Theorem
d+2!
i=1
cipi = 0
d+2!
i=1
ci = 0
I+
= {i : ci > 0}
I!
= {i : ci < 0}
!
i!I+
cipi =!
i!I!
(!ci)pi
!
i!I+
ci =!
i!I!
(!ci)
If P ! Rd has d+2 (or more) points then there is a partition of P into (U,U)such that conv(U) " conv(U) is nonempty.
x =
!
i!I+
"
ci#
j!I+ cj
$
pi =
!
i!I!
"
!ci#
j!I!!cj
$
pi
26
![Page 27: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/27.jpg)
Helly’s TheoremGiven some convex sets in Rd such that every d + 1 sets
have common intersection, then the whole collection of setshas a common intersection.
27
![Page 28: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/28.jpg)
Helly’s TheoremGiven some convex sets in Rd such that every d + 1 sets
have common intersection, then the whole collection of setshas a common intersection.
28
![Page 29: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/29.jpg)
Helly’s TheoremGiven some convex sets in Rd such that every d + 1 sets
have common intersection, then the whole collection of setshas a common intersection.
29
![Page 30: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/30.jpg)
Proof Hint:Use Radon’s Theorem!
30
![Page 31: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/31.jpg)
31
![Page 32: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/32.jpg)
32
![Page 33: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/33.jpg)
33
![Page 34: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/34.jpg)
Fun Exercise:Show that the Radon Point is in every set.
34
![Page 35: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/35.jpg)
More than d+2 sets?
35
![Page 36: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/36.jpg)
The Center Point Theorem
Consider the set of all minimal halfspaces containingat least dn
d+1+ 1 points.
Helly’s Theorem implies that all the halfspaces havea common intersection. The intersection is the setof center points.
Observe that every d + 1 have a common intersection.
36
![Page 37: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/37.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
37
![Page 38: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/38.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
38
![Page 39: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/39.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
39
![Page 40: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/40.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
40
![Page 41: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/41.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
41
![Page 42: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/42.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
42
![Page 43: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/43.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
43
![Page 44: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/44.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
44
![Page 45: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/45.jpg)
Tverberg’s Theorem
Let S be a set of at least (d + 1)(r ! 1) + 1 points in Rd.There exists a partition of S into r subsets X1, . . . , Xr
such that!r
i=1conv(Xi) "= #
Choose r = n/(d+1)It’s a center point!
45
![Page 46: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/46.jpg)
Proof via Helly’s Theorem
Proof via Tverberg’sTheorem
46
![Page 47: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/47.jpg)
Proof via Helly’s Theorem
Proof via Tverberg’sTheorem
coNP NP
47
![Page 48: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/48.jpg)
An Algorithm
48
![Page 49: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/49.jpg)
Approximating Center Points with Iterated Radon Points[ Clarkson, Eppstein, Miller, Sturtivant, Teng, 1993 ]
49
![Page 50: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/50.jpg)
Approximating Center Points with Iterated Radon Points[ Clarkson, Eppstein, Miller, Sturtivant, Teng, 1993 ]
1. Randomly sample points into sets of d+2.2. Compute the Radon point for each set. 3. Compute the Radon points of the Radon points 4. Continue until only one point remains.5. Return that point.
50
![Page 51: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/51.jpg)
Approximating Center Points with Iterated Radon Points[ Clarkson, Eppstein, Miller, Sturtivant, Teng, 1993 ]
1. Randomly sample points into sets of d+2.2. Compute the Radon point for each set. 3. Compute the Radon points of the Radon points 4. Continue until only one point remains.5. Return that point.
O!
n
d2
"
-center with high probability.
51
![Page 52: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/52.jpg)
52
![Page 53: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/53.jpg)
53
![Page 54: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/54.jpg)
54
![Page 55: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/55.jpg)
Analysis looks like Helly-type proof.
Look at all projections to one dimensionat the same time.
55
![Page 56: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/56.jpg)
Let’s build an algorithm so that the analysis will look less like Helly and more like Tverberg.
56
![Page 57: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/57.jpg)
57
![Page 58: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/58.jpg)
58
![Page 59: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/59.jpg)
59
![Page 60: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/60.jpg)
60
![Page 61: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/61.jpg)
61
![Page 62: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/62.jpg)
62
![Page 63: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/63.jpg)
63
![Page 64: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/64.jpg)
64
![Page 65: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/65.jpg)
This almost works.
65
![Page 66: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/66.jpg)
66
![Page 67: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/67.jpg)
67
![Page 68: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/68.jpg)
68
![Page 69: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/69.jpg)
69
![Page 70: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/70.jpg)
70
![Page 71: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/71.jpg)
71
![Page 72: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/72.jpg)
72
![Page 73: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/73.jpg)
73
![Page 74: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/74.jpg)
74
![Page 75: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/75.jpg)
75
![Page 76: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/76.jpg)
76
![Page 77: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/77.jpg)
77
![Page 78: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/78.jpg)
Analysis: How good is the resulting center point?
78
![Page 79: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/79.jpg)
Analysis: How good is the resulting center point?
Say gn is the minimum guaranteed partition size on n points
79
![Page 80: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/80.jpg)
Analysis: How good is the resulting center point?
Say gn is the minimum guaranteed partition size on n points
Suppose for contradiction that gn < n
(d+1)2 .
80
![Page 81: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/81.jpg)
Analysis: How good is the resulting center point?
Say gn is the minimum guaranteed partition size on n points
Then, gn/2 < n2(d+1)2 and the corresponding partition
uses less than n2(d+1) points.
Suppose for contradiction that gn < n
(d+1)2 .
81
![Page 82: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/82.jpg)
Analysis: How good is the resulting center point?
Say gn is the minimum guaranteed partition size on n points
Then, gn/2 < n2(d+1)2 and the corresponding partition
uses less than n2(d+1) points.
So, with n points, we can construct d + 2 pointswith partitions of size gn/2.
Suppose for contradiction that gn < n
(d+1)2 .
82
![Page 83: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/83.jpg)
Analysis: How good is the resulting center point?
Say gn is the minimum guaranteed partition size on n points
Then, gn/2 < n2(d+1)2 and the corresponding partition
uses less than n2(d+1) points.
So, with n points, we can construct d + 2 pointswith partitions of size gn/2.
This means we can iterate the algorithm, andgn ! 2gn/2
Suppose for contradiction that gn < n
(d+1)2 .
83
![Page 84: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/84.jpg)
Analysis: How good is the resulting center point?
Say gn is the minimum guaranteed partition size on n points
Then, gn/2 < n2(d+1)2 and the corresponding partition
uses less than n2(d+1) points.
So, with n points, we can construct d + 2 pointswith partitions of size gn/2.
This means we can iterate the algorithm, andgn ! 2gn/2
Base case: gd+2 = 2.
Suppose for contradiction that gn < n
(d+1)2 .
84
![Page 85: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/85.jpg)
Analysis: How good is the resulting center point?
Say gn is the minimum guaranteed partition size on n points
Then, gn/2 < n2(d+1)2 and the corresponding partition
uses less than n2(d+1) points.
So, with n points, we can construct d + 2 pointswith partitions of size gn/2.
This means we can iterate the algorithm, andgn ! 2gn/2
Base case: gd+2 = 2. =! gn " 2log n
d+2 =n
d + 2
Suppose for contradiction that gn < n
(d+1)2 .
85
![Page 86: Centerpoints Theory Lunch Talk](https://reader034.fdocuments.in/reader034/viewer/2022052619/55509760b4c90590208b4686/html5/thumbnails/86.jpg)
Thank you.
86