the inapproximability of illuminating polygons by -floodlightsakader/files/cccg15_talk.pdf · the...
TRANSCRIPT
![Page 1: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/1.jpg)
The Inapproximability of Illuminating Polygons byα-Floodlights
A. Abdelkader1 A. Saeed 2 K. Harras 3 A. Mohamed 4
1Department of Computer ScienceUniversity of Maryland at College Park
2Department of Computer ScienceGeorgia Institute of Technology
3Department of Computer ScienceCarnegie Mellon University
4Department of Computer Science and EngineeringQatar University
CCCG, 2015
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 1 / 15
![Page 2: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/2.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 3: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/3.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 4: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/4.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 5: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/5.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 6: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/6.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 7: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/7.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 8: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/8.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 9: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/9.jpg)
Guarding & IlluminationMotivation
Guarding Illumination
360◦
0◦ < α < 360◦
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 2 / 15
![Page 10: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/10.jpg)
Preliminaries
Definition (α-Floodlight)
An α-floodlight at point p, with orientation θ, is the infinite wedgeW (p, α, θ) bounded between the two rays −→vl and −→vr starting at p withangles θ ± α
2 . In a polygon P, a point q belongs to the α-floodlight if pqlies entirely in both P and W (p, α, θ).
Problem (Polygon Illumination by α-Floodlights (PFIP))
Given a simple polygon P with n sides, a positive integer m and anangular aperture α, determine if P can be illuminated by at most mα-floodlights placed in its interior.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 3 / 15
![Page 11: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/11.jpg)
Preliminaries
Definition (α-Floodlight)
An α-floodlight at point p, with orientation θ, is the infinite wedgeW (p, α, θ) bounded between the two rays −→vl and −→vr starting at p withangles θ ± α
2 . In a polygon P, a point q belongs to the α-floodlight if pqlies entirely in both P and W (p, α, θ).
Problem (Polygon Illumination by α-Floodlights (PFIP))
Given a simple polygon P with n sides, a positive integer m and anangular aperture α, determine if P can be illuminated by at most mα-floodlights placed in its interior.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 3 / 15
![Page 12: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/12.jpg)
Brief History
Problem (Art Gallery Problem)
Let P be a simple polygon without holes. Find the minimum subset S ofthe vertices of P such that the interior of P is visible from S.
Decision version is NP-hard1.
APX-hard2.
O(log log OPT )-approximation3.
1Lee, D.-T. and Lin, A. K. (1986). Computational complexity of art gallery problems.Information Theory, IEEE Transactions on, 32(2):276–282
2Eidenbenz, S., Stamm, C., and Widmayer, P. (2001). Inapproximability results forguarding polygons and terrains.Algorithmica, 31(1):79–113
3King, J. and Kirkpatrick, D. (2011). Improved approximation for guarding simplegalleries from the perimeter.Discrete & Computational Geometry, 46(2):252–269Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 4 / 15
![Page 13: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/13.jpg)
Brief History
Problem (Art Gallery Problem)
Let P be a simple polygon without holes. Find the minimum subset S ofthe vertices of P such that the interior of P is visible from S.
Decision version is NP-hard1.
APX-hard2.
O(log log OPT )-approximation3.
1Lee, D.-T. and Lin, A. K. (1986). Computational complexity of art gallery problems.Information Theory, IEEE Transactions on, 32(2):276–282
2Eidenbenz, S., Stamm, C., and Widmayer, P. (2001). Inapproximability results forguarding polygons and terrains.Algorithmica, 31(1):79–113
3King, J. and Kirkpatrick, D. (2011). Improved approximation for guarding simplegalleries from the perimeter.Discrete & Computational Geometry, 46(2):252–269Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 4 / 15
![Page 14: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/14.jpg)
Brief History
Problem (Art Gallery Problem)
Let P be a simple polygon without holes. Find the minimum subset S ofthe vertices of P such that the interior of P is visible from S.
Decision version is NP-hard1.
APX-hard2.
O(log log OPT )-approximation3.
1Lee, D.-T. and Lin, A. K. (1986). Computational complexity of art gallery problems.Information Theory, IEEE Transactions on, 32(2):276–282
2Eidenbenz, S., Stamm, C., and Widmayer, P. (2001). Inapproximability results forguarding polygons and terrains.Algorithmica, 31(1):79–113
3King, J. and Kirkpatrick, D. (2011). Improved approximation for guarding simplegalleries from the perimeter.Discrete & Computational Geometry, 46(2):252–269Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 4 / 15
![Page 15: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/15.jpg)
Brief History
Problem (Art Gallery Problem)
Let P be a simple polygon without holes. Find the minimum subset S ofthe vertices of P such that the interior of P is visible from S.
Decision version is NP-hard1.
APX-hard2.
O(log log OPT )-approximation3.
1Lee, D.-T. and Lin, A. K. (1986). Computational complexity of art gallery problems.Information Theory, IEEE Transactions on, 32(2):276–282
2Eidenbenz, S., Stamm, C., and Widmayer, P. (2001). Inapproximability results forguarding polygons and terrains.Algorithmica, 31(1):79–113
3King, J. and Kirkpatrick, D. (2011). Improved approximation for guarding simplegalleries from the perimeter.Discrete & Computational Geometry, 46(2):252–269Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 4 / 15
![Page 16: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/16.jpg)
Reduction from 3SAT [Eidenbenz et al.]Big Picture
[Fig. 3 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 5 / 15
![Page 17: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/17.jpg)
Reduction from 3SAT [Eidenbenz et al.]Clauses & Literals
[Fig. 2 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 5 / 15
![Page 18: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/18.jpg)
Reduction from 3SAT [Eidenbenz et al.]Variables & Literals
[Fig. 4 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 5 / 15
![Page 19: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/19.jpg)
Requirements on Guard Coverage?
x1 x2 x3
x1
[Fig. 3 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 6 / 15
![Page 20: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/20.jpg)
Requirements on Guard Coverage?
x1 x2 x3
x1
[Fig. 3 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 6 / 15
![Page 21: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/21.jpg)
Requirements on Guard Coverage?
x1 x2 x3
x1
[Fig. 3 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 6 / 15
![Page 22: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/22.jpg)
Requirements on Guard Coverage?
x1 x2 x3
x1
[Fig. 3 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 6 / 15
![Page 23: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/23.jpg)
Requirements on Guard Coverage?
[Fig. 3 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 6 / 15
![Page 24: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/24.jpg)
Beam MachineCulberson and Reckhow, FOCS’88 & JAlg’94
[Fig. 7 in Eidenbenz and Widmayer, SICOMP ’03]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 7 / 15
![Page 25: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/25.jpg)
Beam MachineCulberson and Reckhow, FOCS’88 & JAlg’94
[Fig. 9 in Eidenbenz and Widmayer, SICOMP ’03]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 7 / 15
![Page 26: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/26.jpg)
Beam MachineBagga, Gewali and Glasser, CCCG’96
[Fig. 1 in Bagga, Gewali and Glasser, CCCG ’94]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 7 / 15
![Page 27: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/27.jpg)
Beam MachineBagga, Gewali and Glasser, CCCG’96
[Fig. 5 in Bagga, Gewali and Glasser, CCCG ’94]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 7 / 15
![Page 28: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/28.jpg)
Floodlight Gadget
a
b
c
de
e′d′
c′
b′
a′
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 8 / 15
![Page 29: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/29.jpg)
Floodlight Gadget
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 8 / 15
![Page 30: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/30.jpg)
New Beam Machine
Configuration Floodlight possible locations
Nozzle
Aux PFG 1Aux PFG 2
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 9 / 15
![Page 31: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/31.jpg)
New Beam Machine
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 9 / 15
![Page 32: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/32.jpg)
New Beam Machine
A
X
A`
B B`
D D`
E`E
Z Z`
C C`
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 9 / 15
![Page 33: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/33.jpg)
New Beam Machine
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 9 / 15
![Page 34: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/34.jpg)
New Beam Machine
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 9 / 15
![Page 35: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/35.jpg)
Beam Coupling
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 10 / 15
![Page 36: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/36.jpg)
New Clause Gadget
1
2
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 11 / 15
![Page 37: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/37.jpg)
New Variable Gadget
a b
ab
Leftmost T literalLeftmost F literal
Rightmost T spike
Rightmost F spike
[Fig. 1 in Eidenbenz, ISAAC ’98]
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 12 / 15
![Page 38: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/38.jpg)
New Variable Gadget
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 12 / 15
![Page 39: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/39.jpg)
Hardness Results
Theorem
PFIP is NP-hard.
Theorem
FIP is NP-hard.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 13 / 15
![Page 40: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/40.jpg)
Hardness Results
Theorem
PFIP is NP-hard.
Theorem
FIP is NP-hard.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 13 / 15
![Page 41: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/41.jpg)
Hardness Results
Theorem
PFIP is NP-hard.
Theorem
FIP is NP-hard.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 13 / 15
![Page 42: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/42.jpg)
APX-hardnessGap Preserving Reductions (informal)
I
I’
S
S’
Reduction Transformation
(Approximation)Algorithm
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 14 / 15
![Page 43: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/43.jpg)
APX-hardnessAn APX Representative
Problem (5-OCC-MAX-3-SAT)
Given a boolean formula Φ in conjunctive normal form, with m clauses andn variables, 3 literals at most per clause, and 5 literals at most pervariable, find an assignment of the variables that satisfies as many clausesas possible.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 14 / 15
![Page 44: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/44.jpg)
APX-hardnessTransformation Process
1
2
3
4
5
6
d1
d2
d3
BM21
BM22
7
8
9
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 14 / 15
![Page 45: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/45.jpg)
APX-hardness
Definition (Flushing Condition)
An α-floodlight is flush with the vertices of the polygon P if at least oneof −→vl or −→vr passes through some vertex of P, different from p, such that θis determined implicitly.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 14 / 15
![Page 46: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/46.jpg)
APX-hardnessInapproximability Results
Definition (Flushing Condition)
An α-floodlight is flush with the vertices of the polygon P if at least oneof −→vl or −→vr passes through some vertex of P, different from p, such that θis determined implicitly.
Theorem
R-PFIP is APX-hard.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 14 / 15
![Page 47: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/47.jpg)
APX-hardnessInapproximability Results
Definition (Flushing Condition)
An α-floodlight is flush with the vertices of the polygon P if at least oneof −→vl or −→vr passes through some vertex of P, different from p, such that θis determined implicitly.
Theorem
R-PFIP is APX-hard.
Theorem
R-FIP is APX-hard.
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 14 / 15
![Page 48: The Inapproximability of Illuminating Polygons by -Floodlightsakader/files/CCCG15_talk.pdf · The Inapproximability of Illuminating Polygons by -Floodlights A. Abdelkader1 A. Saeed](https://reader033.vdocuments.site/reader033/viewer/2022042010/5e720054d5731d30842b0bfb/html5/thumbnails/48.jpg)
Thank You
Abdelkader∗, Saeed, Harras, Mohamed Illuminating Polygons by α-Floodlights CCCG, 2015 15 / 15