Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Combinatorics and complexity of guarding...

Cannon, Sarah...

Free

Share this content

Combinatorics and complexity of guarding polygons with edge and point 2-transmitters by Cannon, Sarah ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	19-03-2015
Summary	We consider a generalization of the classical Art Gallery Problem, where instead of a light source, the guards, called k-transmitters, model a wireless device with a signal that can pass through at most k walls. We show it is NP-hard to compute a minimum cover of point 2-transmitters, point k-transmitters, and edge 2-transmitters in a simple polygon. The point 2-transmitter result extends to orthogonal polygons. In addition, we give necessity and sufficiency results for the number of edge 2-transmitters in general, monotone, orthogonal monotone, and orthogonal polygons.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	https://arxiv.org/abs/1503.05681

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Cannon, Sarah. Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. N.A. March 19, 2015. Accessed August 18, 2025. https://online.provdatabase.com/cite/18450

APA 7th EditionReferences

Cannon, Sarah. (2015). Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. N.A. https://online.provdatabase.com/cite/18450

Chicago 17th EditionReferences

Cannon, Sarah. Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. N.A. 2015. https://online.provdatabase.com/cite/18450

HarvardReferences

Cannon, Sarah. (2015). Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18450. (Accessed 18 August 2025).

Harvard AustraliaReferences

Cannon, Sarah, 2015, Combinatorics and complexity of guarding polygons with edge and point 2-transmitters, N.A, viewed 18 August 2025, <https://online.provdatabase.com/cite/18450>

MLA 9th EditionWorks Cited

Cannon, Sarah. Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. N.A, 2015. PROV Database, https://online.provdatabase.com/cite/18450.

Share this eBook