Guarding galleries and terrains

Alon Efrat; Sariel Har-Peled

doi:10.1007/978-0-387-35608-2_16

Guarding galleries and terrains

Alon Efrat, Sariel Har-Peled

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English (US)
Title of host publication	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)
Publisher	Springer
Pages	181-192
Number of pages	12
ISBN (Print)	9781475752755
DOIs	https://doi.org/10.1007/978-0-387-35608-2_16
State	Published - 2002
Event	IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 - Montreal, QC, Canada Duration: Aug 25 2002 → Aug 30 2002

Publication series

Name	IFIP Advances in Information and Communication Technology
Volume	96
ISSN (Print)	1868-4238

Other

Other	IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002
Country/Territory	Canada
City	Montreal, QC
Period	8/25/02 → 8/30/02

ASJC Scopus subject areas

Information Systems
Computer Networks and Communications
Information Systems and Management

Online availability

10.1007/978-0-387-35608-2_16

Library availability

Discover UIUC Full Text

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. https://doi.org/10.1007/978-0-387-35608-2_16

Guarding galleries and terrains. / Efrat, Alon; Har-Peled, Sariel.
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). Springer, 2002. p. 181-192 (IFIP Advances in Information and Communication Technology; Vol. 96).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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). IFIP Advances in Information and Communication Technology, vol. 96, Springer, pp. 181-192, IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, Montreal, QC, Canada, 8/25/02. https://doi.org/10.1007/978-0-387-35608-2_16

Efrat A, Har-Peled S. 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). Springer. 2002. p. 181-192. (IFIP Advances in Information and Communication Technology). doi: 10.1007/978-0-387-35608-2_16

@inproceedings{3400e1f86d024257a9e074dd4d744fe6,

title = "Guarding galleries and terrains",

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.",

author = "Alon Efrat and Sariel Har-Peled",

note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 ; Conference date: 25-08-2002 Through 30-08-2002",

year = "2002",

doi = "10.1007/978-0-387-35608-2_16",

language = "English (US)",

isbn = "9781475752755",

series = "IFIP Advances in Information and Communication Technology",

publisher = "Springer",

pages = "181--192",

booktitle = "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)",

address = "Germany",

}

TY - GEN

T1 - Guarding galleries and terrains

AU - Efrat, Alon

AU - Har-Peled, Sariel

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-0-387-35608-2_16

DO - 10.1007/978-0-387-35608-2_16

M3 - Conference contribution

AN - SCOPUS:54349087002

SN - 9781475752755

T3 - IFIP Advances in Information and Communication Technology

SP - 181

EP - 192

BT - 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)

PB - Springer

T2 - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002

Y2 - 25 August 2002 through 30 August 2002

ER -

Guarding galleries and terrains

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this