Approximate Guarding of Monotone and Rectilinear Polygons

DSpace Repository

Approximate Guarding of Monotone and Rectilinear Polygons

Show full item record

Files for download

Facebook

Simple item record

Publication Conference Paper, peer reviewed
Title Approximate Guarding of Monotone and Rectilinear Polygons
Author(s) Nilsson, Bengt J
Date 2005
Editor(s) Caires, Luís; Italiano, Giuseppe F; Monteiro, Luís; Palamidessi, Catuscia; Yung, Moti
English abstract
We show a constant factor approximation algorithm for interior guarding of monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the number of vertices of the polygon. If the size of the smallest interior guard cover is \OPT\ for a rectilinear polygon, our algorithm produces a guard set of size~$O(\OPT^2)$.
DOI http://dx.doi.org/10.1007/11523468 (link to publisher's fulltext)
Publisher Springer Verlag
Host/Issue Automata, Languages and Programming
Series/Issue Lecture Notes in Computer Science;3580
ISSN 0302-9743
ISBN 978-3-540-27580-0
Pages 1362-1373
Language eng (iso)
Subject(s) Sciences
Research Subject Categories::MATHEMATICS::Applied mathematics::Theoretical computer science
Research Subject Categories::TECHNOLOGY::Information technology::Computer science::Computer science
Note 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005. Lisbon, Portugal, July 11-15, 2005
Handle http://hdl.handle.net/2043/11487 (link to this page)
Link http://icalp05.di.fct.unl.pt/ (external link to related web page)

This item appears in the following Collection(s)

Show full item record

Search


Browse

My Account

Statistics