Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali  Home/Search
Context Related
| stanford.edu/~alon/papers/chain.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: arizona.edu/~alon/CV/cv3 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of locating a continuously-moving target using a group of guards moving inside a simple polygon. Our guards always form a simple polygonal chain within the polygon such that consecutive guards along the chain are mutually visible. We develop algorithms that sweep such a chain of guards through a polygon to locate the target. Our two main results are the following: 1. an algorithm to compute the minimum number r # of guards needed to sweep an n-vertex polygon that... (Update)
Cited by: More
Pursuit-Evasion in an Unknown Environment - Using Gap Navigation (Correct)
An Algorithm for Searching a Polygonal Region with a - Flashlight Steven Lavalle (Correct)
A Complete Pursuit-Evasion Algorithm for Two Pursuers - Using Beam Detection (Correct)
Similar documents (at the sentence level):
75.6%: Sweeping Simple Polygons with a Chain of Guards - Efrat, Guibas, Har-Peled.. (2000) (Correct)
25.8%: New Similarity Measures between Polylines with.. - Efrat, Guibas.. (2001) (Correct)
Active bibliography (related documents): More All
0.5: Interactive Ray Tracing With the Visibility Complex - Cho, Forsyth (1999) (Correct)
0.4: Geometric Shortest Paths and Network Optimization - Mitchell (1998) (Correct)
0.4: Visibility with Multiple Reflections - Aronov, Davis, Dey, Pal, Prasad (1996) (Correct)
Similar documents based on text: More All
0.2: Touring a Sequence of Polygons - Dror, Efrat, Lubiw, Mitchell (2003) (Correct)
0.2: Approximation Algorithms for Two Optimal Location.. - Efrat, Har-Peled.. (2004) (Correct)
0.2: The Optimal Power Allocation for Equal-Length Twisted-Pair Channels - Cioffi (2003) (Correct)
Related documents from co-citation: More All
14: Searching for a mobile intruder in a polygonal region (context) - Suzuki, Yamashita - 1992
11: The Two Guards Problem - Icking, Klein
10: Visibility-based pursuit-evasion in a polygonal room with a door (context) - Lee, Shin et al. - 1999
BibTeX entry: (Update)
A. Efrat, L. J. Guibas, S. Har-Peled, D. C. Lin, J. S. B. Mitchell, and T. M. Murali. Sweeping simple polygons with a chain of guards. In Proceedings, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000. to appear. http://citeseer.ist.psu.edu/efrat99sweeping.html More
@inproceedings{ efrat00sweeping,
author = "Alon Efrat and Leonidas J. Guibas and Sariel Har-Peled and David C. Lin and Joseph S. B. Mitchell and T. M. Murali",
title = "Sweeping simple polygons with a chain of guards",
booktitle = "Symposium on Discrete Algorithms",
pages = "927-936",
year = "2000",
url = "citeseer.ist.psu.edu/efrat99sweeping.html" }
Citations (may not include all citations):118 Ray shooting and parametric search (context) - Agarwal, Matousek - 1993
63 Ray shooting in polygons using geodesic triangulations (context) - Chazelle, Edelsbrunner et al. - 1994
62 the complexity of searching a graph (context) - Megiddo, Hakimi et al. - 1988
54 Pursuit-evasion in a graph (context) - Parsons - 1976
50 Searching for a mobile intruder in a polygonal region (context) - Suzuki, Yamashita - 1992
39 Finding an unpredictable target in a workspace with obstacle.. - LaValle, Lin et al. - 1997
31 The two guards problem - Icking, Klein - 1992
31 Visibility-based pursuit evasion in a polygonal environment - Guibas, Latombe et al. - 1997
27 On some link distance problems in a simple polygon (context) - Suri - 1990
24 The International Series of Monographs on Computer Science (context) - O'Rourke, Theorems - 1987
24 Shortest watchman routes in simple polygons (context) - Chin, Ntafos - 1991
23 Searching for a mobile intruder in a corridor --- the open e.. (context) - Crass, Suzuki et al. - 1995
20 Minimum link paths in polygons and related problems (context) - Suri - 1987
19 Finding minimal convex nested polygons (context) - Aggarwal, Booth et al. - 1989
19 Art gallery and illumination problems (context) - Urrutia - 1997
18 algorithm for computing the link center of a simple polygon (context) - Djidjev, Lingas et al. - 1992
14 An optimal algorithm for the two-guard problem (context) - He - 1996
11 The art gallery theorem for polygons with holes (context) - Ho, Kaufmann et al. - 1991
8 Searching a simple polygon by a k-searcher (context) - Tan - 1999
8 Computing a shortest watchman path in a simple polygon in po.. (context) - Carlsson, Jonsson - 1995
7 Ray shooting and lines in space (context) - Pellegrini - 1997
6 Minimum-link watchman tours - Arkin, Mitchell et al. - 1994
6 Logarithmic-time link path queries in a simple polygon (context) - Arkin, Mitchell et al. - 1995
5 Polygon visibility algorithms for weak visibility and link d.. (context) - Ke - 1989
4 Moving along a street (context) - Klein - 1991
2 cient algorithms for ray shooting and hidden surface removal (context) - de Berg - 1992
1 cient algorithm for link-distance problems (context) - Ke - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.arizona.edu/~alon/CV/cv3.html): More
On Incremental Rendering of Silhouette Maps of a.. - Zhang, Efrat, Guibas.. (1999) (Correct)
On the Complexity of the Union of Fat Objects in the Plane - Efrat, Sharir (1998) (Correct)
On the Union of Fat Wedges and Separating a Collection of.. - Efrat, Rote, Sharir (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC