Abstract
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains. This means that there always exists a subset of the given points, for which no point of the curve’s interior domain sees all points of the subset and no point of its complement. As a consequence, we obtain a new result on guarding art galleries. If each point of the art gallery sees at least an r-th part of the gallery’s boundary, then the art gallery can be covered by 13 ·C ·r logr guards placed on the boundary. Here, C is the constant from the ε-net theorem.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Isler, V., Kannan, S., Daniilidis, K., Valtr, P.: VC-dimension of exterior visibility. IEEE Trans. Pattern Analysis and Machine Intelligence 26(5), 667–671 (2004)
Kalai, G., Matoušek, J.: Guarding Galleries Where Every Point Sees a Large Area. Israel Journal of Mathematics 101, 125–139 (1997)
King, J.: VC-Dimension of Visibility on Terrains. In: Proc. 20th Canadian Conf. on Computational Geometry (CCCG 2008), pp. 27–30 (2008)
Kirkpatrick, D.: Guarding Galleries with No Nooks. In: Proc. 12th Canadian Conf. on Computational Geometry (CCCG 2000), pp. 43–46 (2000)
Matoušek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, Heidelberg (2002)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)
Urrutia, J.: Art Gallery and Illumination Problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973–1023. North-Holland, Amsterdam (2000)
Valtr, P.: Guarding Galleries Where No Point Sees a Small Area. Israel Journal of Mathematics 104, 1–16 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilbers, A., Klein, R. (2009). New Results on Visibility in Simple Polygons. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-03367-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03366-7
Online ISBN: 978-3-642-03367-4
eBook Packages: Computer ScienceComputer Science (R0)