Guarding galleries and terrains

Alon Efrat, Sariel Har-Peled

Research output: Contribution to journalArticle

61 Citations (Scopus)

Abstract

Let P be a 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 G of points of P so that each point of P is seen by at least one point of G, and the points of G are constrained to be belong to the set of vertices of an arbitrarily dense grind. We also present similar algorithms for terrains and polygons with holes.

Original languageEnglish (US)
Pages (from-to)238-245
Number of pages8
JournalInformation Processing Letters
Volume100
Issue number6
DOIs
StatePublished - Dec 31 2006

Fingerprint

Approximation algorithms
Polygon
Line segment
Approximation Algorithms
Closure
Efficient Algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Guarding galleries and terrains. / Efrat, Alon; Har-Peled, Sariel.

In: Information Processing Letters, Vol. 100, No. 6, 31.12.2006, p. 238-245.

Research output: Contribution to journalArticle

Efrat, Alon ; Har-Peled, Sariel. / Guarding galleries and terrains. In: Information Processing Letters. 2006 ; Vol. 100, No. 6. pp. 238-245.
@article{d609a6bbc8a44049b3751c5df6c3e856,
title = "Guarding galleries and terrains",
abstract = "Let P be a 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 G of points of P so that each point of P is seen by at least one point of G, and the points of G are constrained to be belong to the set of vertices of an arbitrarily dense grind. We also present similar algorithms for terrains and polygons with holes.",
author = "Alon Efrat and Sariel Har-Peled",
year = "2006",
month = "12",
day = "31",
doi = "10.1016/j.ipl.2006.05.014",
language = "English (US)",
volume = "100",
pages = "238--245",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - Guarding galleries and terrains

AU - Efrat, Alon

AU - Har-Peled, Sariel

PY - 2006/12/31

Y1 - 2006/12/31

N2 - Let P be a 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 G of points of P so that each point of P is seen by at least one point of G, and the points of G are constrained to be belong to the set of vertices of an arbitrarily dense grind. We also present similar algorithms for terrains and polygons with holes.

AB - Let P be a 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 G of points of P so that each point of P is seen by at least one point of G, and the points of G are constrained to be belong to the set of vertices of an arbitrarily dense grind. We also present similar algorithms for terrains and polygons with holes.

UR - http://www.scopus.com/inward/record.url?scp=33749991397&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749991397&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2006.05.014

DO - 10.1016/j.ipl.2006.05.014

M3 - Article

AN - SCOPUS:33749991397

VL - 100

SP - 238

EP - 245

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 6

ER -