Upload
others
View
0
Download
0
Embed Size (px)
Citation preview
X-Raying 3-Dimensional Convex Bodieswith Mirror Symmetry
Ryan Trelford
University of Calgary
Discrete Geometry and Symmetry WorkshopBanff International Research Station
February 10, 2015
1 / 24
Overview
The problems of illumination and covering, and their conjectures,formulated in 1960 by Boltyanski, Hadwiger, and Gohberg, Markus,have become central problems in the fields of convex, computational,and discrete geometry, and have received much attention over the last50 years.
However, in dimensions three and higher, only partial results have beenobtained.
X-Raying is a related problem that may yield results for the problem ofIllumination.
2 / 24
Overview
The problems of illumination and covering, and their conjectures,formulated in 1960 by Boltyanski, Hadwiger, and Gohberg, Markus,have become central problems in the fields of convex, computational,and discrete geometry, and have received much attention over the last50 years.
However, in dimensions three and higher, only partial results have beenobtained.
X-Raying is a related problem that may yield results for the problem ofIllumination.
2 / 24
Overview
The problems of illumination and covering, and their conjectures,formulated in 1960 by Boltyanski, Hadwiger, and Gohberg, Markus,have become central problems in the fields of convex, computational,and discrete geometry, and have received much attention over the last50 years.
However, in dimensions three and higher, only partial results have beenobtained.
X-Raying is a related problem that may yield results for the problem ofIllumination.
2 / 24
Outline
1 Covering, Illumination and X-Raying
2 X-Raying in the Plane
3 X-Raying 3-Dimensional Convex Bodies with Mirror Symmetry
3 / 24
Covering
Definition
Let K ⊂ Ed be a convex body.For 0 < µ < 1, the set µK is called a smaller homothetic copy ofK.
The covering number of K, C(K), is the smallest number oftranslated smaller homothetic copies of K needed to cover K.
4 / 24
Covering
Definition
Let K ⊂ Ed be a convex body.For 0 < µ < 1, the set µK is called a smaller homothetic copy ofK.
The covering number of K, C(K), is the smallest number oftranslated smaller homothetic copies of K needed to cover K.
4 / 24
Covering
Definition
Let K ⊂ Ed be a convex body.For 0 < µ < 1, the set µK is called a smaller homothetic copy ofK.
The covering number of K, C(K), is the smallest number oftranslated smaller homothetic copies of K needed to cover K.
4 / 24
Illumination
Definition
Let K ⊂ Ed be a convex body.Let p ∈ bd(K) and v ∈ Ed \ {O} be a direction. Then v is said toilluminate the boundary point p if the open ray emanating from pwith direction v intersects the interior of K.
A collection of directions, v1, . . . ,vn ∈ Ed \ {O} are said toilluminate K if every point p ∈ bd(K) is illuminated by at leastone of the vi’s.
The illumination number of K, I(K), is the smallest integer nsuch that there exists n distinct directions, v1, . . . ,vn, thatilluminate K.
5 / 24
Illumination
Definition
Let K ⊂ Ed be a convex body.Let p ∈ bd(K) and v ∈ Ed \ {O} be a direction. Then v is said toilluminate the boundary point p if the open ray emanating from pwith direction v intersects the interior of K.
A collection of directions, v1, . . . ,vn ∈ Ed \ {O} are said toilluminate K if every point p ∈ bd(K) is illuminated by at leastone of the vi’s.
The illumination number of K, I(K), is the smallest integer nsuch that there exists n distinct directions, v1, . . . ,vn, thatilluminate K.
5 / 24
Illumination
Definition
Let K ⊂ Ed be a convex body.Let p ∈ bd(K) and v ∈ Ed \ {O} be a direction. Then v is said toilluminate the boundary point p if the open ray emanating from pwith direction v intersects the interior of K.
A collection of directions, v1, . . . ,vn ∈ Ed \ {O} are said toilluminate K if every point p ∈ bd(K) is illuminated by at leastone of the vi’s.
The illumination number of K, I(K), is the smallest integer nsuch that there exists n distinct directions, v1, . . . ,vn, thatilluminate K.
5 / 24
Illumination
6 / 24
Conjectures
Covering Conjecture (Gohberg, Markus - 1960)
Let K ⊂ Ed be a convex body. Then C(K) ≤ 2d, with equality if, andonly if, K is an affine cube.
Illumination Conjecture (Boltyanski, Hadwiger - 1960)
Let K ⊂ Ed be a convex body. Then I(K) ≤ 2d, with equality if, andonly if, K is an affine cube.
Theorem
For any d-dimensional convex body K, C(K) = I(K).
7 / 24
Conjectures
Covering Conjecture (Gohberg, Markus - 1960)
Let K ⊂ Ed be a convex body. Then C(K) ≤ 2d, with equality if, andonly if, K is an affine cube.
Illumination Conjecture (Boltyanski, Hadwiger - 1960)
Let K ⊂ Ed be a convex body. Then I(K) ≤ 2d, with equality if, andonly if, K is an affine cube.
Theorem
For any d-dimensional convex body K, C(K) = I(K).
7 / 24
Conjectures
Covering Conjecture (Gohberg, Markus - 1960)
Let K ⊂ Ed be a convex body. Then C(K) ≤ 2d, with equality if, andonly if, K is an affine cube.
Illumination Conjecture (Boltyanski, Hadwiger - 1960)
Let K ⊂ Ed be a convex body. Then I(K) ≤ 2d, with equality if, andonly if, K is an affine cube.
Theorem
For any d-dimensional convex body K, C(K) = I(K).
7 / 24
Two Dimensional Result
Theorem
Levi (1955) showed that for a planar convex body K,
C(K) =
{4, if K is an affine square,3, otherwise.
These conjectures remain open in dimensions d > 2. In 1999,Papadoperakis showed that I(K) ≤ 16 for any convex body K of E3.
8 / 24
Two Dimensional Result
Theorem
Levi (1955) showed that for a planar convex body K,
C(K) =
{4, if K is an affine square,3, otherwise.
These conjectures remain open in dimensions d > 2. In 1999,Papadoperakis showed that I(K) ≤ 16 for any convex body K of E3.
8 / 24
X-Raying
Definition
Let K ⊂ Ed be a convex body and v ∈ Ed be a direction.A line with direction v is denoted by `v. A line through a point qwith direction v is denoted by ` qv.
For p ∈ bd(K), we say that p is X-Rayed along `v if ` pv intersectsthe interior of K.
A collection of lines, `v1 , . . . , `vn , is said to X-Ray K if every pointp ∈ bd(K) is X-Rayed along at least one of these lines.The X-Ray number of K, X(K), is the smallest integer n suchthat there exists n distinct lines `v1 , . . . , `vn , that X-ray K.
9 / 24
X-Raying
Definition
Let K ⊂ Ed be a convex body and v ∈ Ed be a direction.A line with direction v is denoted by `v. A line through a point qwith direction v is denoted by ` qv.
For p ∈ bd(K), we say that p is X-Rayed along `v if ` pv intersectsthe interior of K.
A collection of lines, `v1 , . . . , `vn , is said to X-Ray K if every pointp ∈ bd(K) is X-Rayed along at least one of these lines.The X-Ray number of K, X(K), is the smallest integer n suchthat there exists n distinct lines `v1 , . . . , `vn , that X-ray K.
9 / 24
X-Raying
Definition
Let K ⊂ Ed be a convex body and v ∈ Ed be a direction.A line with direction v is denoted by `v. A line through a point qwith direction v is denoted by ` qv.
For p ∈ bd(K), we say that p is X-Rayed along `v if ` pv intersectsthe interior of K.
A collection of lines, `v1 , . . . , `vn , is said to X-Ray K if every pointp ∈ bd(K) is X-Rayed along at least one of these lines.
The X-Ray number of K, X(K), is the smallest integer n suchthat there exists n distinct lines `v1 , . . . , `vn , that X-ray K.
9 / 24
X-Raying
Definition
Let K ⊂ Ed be a convex body and v ∈ Ed be a direction.A line with direction v is denoted by `v. A line through a point qwith direction v is denoted by ` qv.
For p ∈ bd(K), we say that p is X-Rayed along `v if ` pv intersectsthe interior of K.
A collection of lines, `v1 , . . . , `vn , is said to X-Ray K if every pointp ∈ bd(K) is X-Rayed along at least one of these lines.The X-Ray number of K, X(K), is the smallest integer n suchthat there exists n distinct lines `v1 , . . . , `vn , that X-ray K.
9 / 24
X-Ray Conjecture (Bezdek, Zamfirescu - 1994)
For any convex body K ⊂ Ed, X(K) ≤ 3 · 2d−2.
Lemma
For any convex body K, X(K) ≤ I(K) ≤ 2X(K).
10 / 24
X-Ray Conjecture (Bezdek, Zamfirescu - 1994)
For any convex body K ⊂ Ed, X(K) ≤ 3 · 2d−2.
Lemma
For any convex body K, X(K) ≤ I(K) ≤ 2X(K).
10 / 24
X-Ray Conjecture (Bezdek, Zamfirescu - 1994)
For any convex body K ⊂ Ed, X(K) ≤ 3 · 2d−2.
Lemma
For any convex body K, X(K) ≤ I(K) ≤ 2X(K).
10 / 24
X-Ray Conjecture (Bezdek, Zamfirescu - 1994)
For any convex body K ⊂ Ed, X(K) ≤ 3 · 2d−2.
Lemma
For any convex body K, X(K) ≤ I(K) ≤ 2X(K).
10 / 24
X-Ray Conjecture (Bezdek, Zamfirescu - 1994)
For any convex body K ⊂ Ed, X(K) ≤ 3 · 2d−2.
Lemma
For any convex body K, X(K) ≤ I(K) ≤ 2X(K).
10 / 24
Outline
1 Covering, Illumination and X-Raying
2 X-Raying in the Plane
3 X-Raying 3-Dimensional Convex Bodies with Mirror Symmetry
11 / 24
Planar X-Ray Conjecture: First Result
From the result of Levi, we have:
Corollary
Let K be a planar convex body. Then
X(K) =
{2, if K is an affine square,3, otherwise.
12 / 24
Planar X-Ray Conjecture: First Result
From the result of Levi, we have:
Corollary
Let K be a planar convex body. Then
X(K) =
{2, if K is an affine square,3, otherwise.
12 / 24
Planar X-Ray Conjecture: First Result
From the result of Levi, we have:
Corollary
Let K be a planar convex body. Then
X(K) =
{2, if K is an affine square,3, otherwise.
12 / 24
Planar X-Ray Conjecture: Second Result
However, we will need a stronger result:
Theorem (R.T. 2014)
Let K be a planar convex body. Then
X(K) =
{3, if K is triangle,2, otherwise.
13 / 24
Planar X-Ray Conjecture: Second Result
However, we will need a stronger result:
Theorem (R.T. 2014)
Let K be a planar convex body. Then
X(K) =
{3, if K is triangle,2, otherwise.
13 / 24
Planar X-Ray Conjecture: Second Result
However, we will need a stronger result:
Theorem (R.T. 2014)
Let K be a planar convex body. Then
X(K) =
{3, if K is triangle,2, otherwise.
13 / 24
Planar X-Ray Conjecture: Second Result
However, we will need a stronger result:
Theorem (R.T. 2014)
Let K be a planar convex body. Then
X(K) =
{3, if K is triangle,2, otherwise.
13 / 24
Outline
1 Covering, Illumination and X-Raying
2 X-Raying in the Plane
3 X-Raying 3-Dimensional Convex Bodies with Mirror Symmetry
14 / 24
Mirror Symmetry
Let K be a 3-dimensional convex body with mirror symmetry(symmetric about a plane). Without loss of generality, we may assumeK is symmetric about the xy-plane.
Theorem (R.T. 2014)
Let K be a 3-dimensional convex body with mirror symmetry. ThenX(K) ≤ 6 = 3 · 23−2 .
Definition
Let B be the intersection of K with the xy-plane.
A point p ∈ relbd(B) is a ground point if ` pe3 ∩K = {p}. (here,e3 = [ 0 0 1 ]
T ). Otherwise, p is a cliff point
15 / 24
Mirror Symmetry
Let K be a 3-dimensional convex body with mirror symmetry(symmetric about a plane). Without loss of generality, we may assumeK is symmetric about the xy-plane.
Theorem (R.T. 2014)
Let K be a 3-dimensional convex body with mirror symmetry. ThenX(K) ≤ 6 = 3 · 23−2 .
Definition
Let B be the intersection of K with the xy-plane.
A point p ∈ relbd(B) is a ground point if ` pe3 ∩K = {p}. (here,e3 = [ 0 0 1 ]
T ). Otherwise, p is a cliff point
15 / 24
Mirror Symmetry
Let K be a 3-dimensional convex body with mirror symmetry(symmetric about a plane). Without loss of generality, we may assumeK is symmetric about the xy-plane.
Theorem (R.T. 2014)
Let K be a 3-dimensional convex body with mirror symmetry. ThenX(K) ≤ 6 = 3 · 23−2 .
Definition
Let B be the intersection of K with the xy-plane.
A point p ∈ relbd(B) is a ground point if ` pe3 ∩K = {p}. (here,e3 = [ 0 0 1 ]
T ). Otherwise, p is a cliff point
15 / 24
Mirror Symmetry
Let K be a 3-dimensional convex body with mirror symmetry(symmetric about a plane). Without loss of generality, we may assumeK is symmetric about the xy-plane.
Theorem (R.T. 2014)
Let K be a 3-dimensional convex body with mirror symmetry. ThenX(K) ≤ 6 = 3 · 23−2 .
Definition
Let B be the intersection of K with the xy-plane.
A point p ∈ relbd(B) is a ground point if ` pe3 ∩K = {p}. (here,e3 = [ 0 0 1 ]
T ). Otherwise, p is a cliff point
15 / 24
Ground Points and Cliff Points
To X-Ray K, we first X-Ray B in the xy-plane, and then “tilt” thelines up and down to X-Ray K.
16 / 24
Ground Points and Cliff Points
To X-Ray K, we first X-Ray B in the xy-plane, and then “tilt” thelines up and down to X-Ray K.
16 / 24
The Problem with Ground Points
17 / 24
The Problem with Ground Points
17 / 24
The Problem with Ground Points
17 / 24
The Problem with Ground Points
17 / 24
The Problem with Ground Points
Each line `v will yield two new lines, `v+ and `v− but we must keep `vto account for ground points.
17 / 24
B is not a Triangle
18 / 24
B is not a Triangle
X(K) ≤ 6
18 / 24
B is a Triangle
CASE I: x1, x2, x3 are ground points.
19 / 24
B is a Triangle
CASE I: x1, x2, x3 are ground points. X(K) ≤ 5.
19 / 24
B is a Triangle
CASE II: x1, x2 are ground points, x3 is a cliff point.
20 / 24
B is a Triangle
CASE II: x1, x2 are ground points, x3 is a cliff point.
20 / 24
B is a Triangle
CASE II: x1, x2 are ground points, x3 is a cliff point. X(K) ≤ 4.
20 / 24
B is a Triangle
CASE III: x1 is a ground point, x2, x3 are cliff points.
21 / 24
B is a Triangle
CASE III: x1 is a ground point, x2, x3 are cliff points.
21 / 24
B is a Triangle
CASE III: x1 is a ground point, x2, x3 are cliff points. X(K) ≤ 5.
21 / 24
B is a Triangle
CASE IV: x1, x2, x3 are cliff points.
22 / 24
B is a Triangle
CASE IV: x1, x2, x3 are cliff points.
22 / 24
B is a Triangle
CASE IV: x1, x2, x3 are cliff points. X(K) = 6.
22 / 24
Why X-Ray?
A relatively new problem with not many results.
Possibly easier than illuminating: Dekster (2000) proved thatI(K) ≤ 8 for 3-dimensional convex bodies K with mirrorsymmetry, but used 20+ cases...
May lead to better bounds on the illumination number: for d = 3,if X(K) ≤ 6 then I(K) ≤ 2 · 6 = 12 < 16.The lines that X-Ray a convex body K give rise to pairs ofopposite directions that illuminate K (i.e. a starting point to findI(K)).
23 / 24
Why X-Ray?
A relatively new problem with not many results.
Possibly easier than illuminating:
Dekster (2000) proved thatI(K) ≤ 8 for 3-dimensional convex bodies K with mirrorsymmetry, but used 20+ cases...
May lead to better bounds on the illumination number: for d = 3,if X(K) ≤ 6 then I(K) ≤ 2 · 6 = 12 < 16.The lines that X-Ray a convex body K give rise to pairs ofopposite directions that illuminate K (i.e. a starting point to findI(K)).
23 / 24
Why X-Ray?
A relatively new problem with not many results.
Possibly easier than illuminating: Dekster (2000) proved thatI(K) ≤ 8 for 3-dimensional convex bodies K with mirrorsymmetry, but used 20+ cases...
May lead to better bounds on the illumination number: for d = 3,if X(K) ≤ 6 then I(K) ≤ 2 · 6 = 12 < 16.The lines that X-Ray a convex body K give rise to pairs ofopposite directions that illuminate K (i.e. a starting point to findI(K)).
23 / 24
Why X-Ray?
A relatively new problem with not many results.
Possibly easier than illuminating: Dekster (2000) proved thatI(K) ≤ 8 for 3-dimensional convex bodies K with mirrorsymmetry, but used 20+ cases...
May lead to better bounds on the illumination number: for d = 3,if X(K) ≤ 6 then I(K) ≤ 2 · 6 = 12 < 16.
The lines that X-Ray a convex body K give rise to pairs ofopposite directions that illuminate K (i.e. a starting point to findI(K)).
23 / 24
Why X-Ray?
A relatively new problem with not many results.
Possibly easier than illuminating: Dekster (2000) proved thatI(K) ≤ 8 for 3-dimensional convex bodies K with mirrorsymmetry, but used 20+ cases...
May lead to better bounds on the illumination number: for d = 3,if X(K) ≤ 6 then I(K) ≤ 2 · 6 = 12 < 16.The lines that X-Ray a convex body K give rise to pairs ofopposite directions that illuminate K (i.e. a starting point to findI(K)).
23 / 24
Thank You
24 / 24
Covering, Illumination and X-RayingX-Raying in the PlaneX-Raying 3-Dimensional Convex Bodies with Mirror Symmetry