Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Searching a polygonal room with one door by a 1-searcher

Lee, J.-H., Park, S.-M., & Chwa, K.-Y. (2000). Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications, 10(2), 201-220.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-33FB-A Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-33FC-8
Genre: Zeitschriftenartikel

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Lee, Jae-Ha1, Autor           
Park, Sang-Min, Autor
Chwa, Kyung-Yong, Autor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: The {\em 1-searcher} is a mobile guard whose visibility is limited to a ray emanating from his position, where the direction of the ray can be changed continuously with bounded angular rotation speed. Given a polygonal region $\poly$ with a specified boundary point $d$, is it possible for a 1-searcher to eventually {\em see} a mobile intruder that is arbitrarily faster than the searcher within $\poly$, before the intruder reaches $d$? We decide this question in $O(n\log n)$-time for an $n$-sided polygon. Our main result is a simple characterization of the class of polygons (with a boundary point $d$) that admits such a search strategy. We also present a simple $O(n^2)$-time algorithm for constructing a search schedule, if one exists. Finally, we compare the search capability of a 1-searcher with that of two guards.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-022000
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 518129
Anderer: Local-ID: C1256428004B93B8-8C26AE3D830B1963C12569FA003B82E7-Leejh2000a
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: International Journal of Computational Geometry and Applications
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 10 (2) Artikelnummer: - Start- / Endseite: 201 - 220 Identifikator: ISSN: 0218-1959