Guarding galleries and terrains

Alon Efrat, Sariel Har-Peled

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

Let P be a simple polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficient approximation algorithms for finding the smallest set S of points of P so that each point of P is seen by at least one point of S. We also present similar algorithms for terrains and polygons with holes.

Original languageEnglish (US)
Title of host publicationFoundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002)
PublisherSpringer New York LLC
Pages181-192
Number of pages12
ISBN (Print)9781475752755
DOIs
StatePublished - Jan 1 2002
EventIFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 - Montreal, QC, Canada
Duration: Aug 25 2002Aug 30 2002

Publication series

NameIFIP Advances in Information and Communication Technology
Volume96
ISSN (Print)1868-4238

Other

OtherIFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002
CountryCanada
CityMontreal, QC
Period8/25/028/30/02

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Guarding galleries and terrains'. Together they form a unique fingerprint.

  • Cite this

    Efrat, A., & Har-Peled, S. (2002). Guarding galleries and terrains. In Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002) (pp. 181-192). (IFIP Advances in Information and Communication Technology; Vol. 96). Springer New York LLC. https://doi.org/10.1007/978-0-387-35608-2_16