ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The two guards problem
Source Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents
North Conway, New Hampshire, United States
Pages: 166 - 175  
Year of Publication: 1991
ISBN:0-89791-426-0
Authors
Christian Icking
Rolf Klein
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 6
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109667
What is a DOI?

CITED BY  6
Masfumi Yamashita , Hideki Umemoto , Ichiro Suzuki , Tsunehiko Kameda, Searching for mobile intruders in a polygonal region by a group of mobile searchers (extended abstract), Proceedings of the thirteenth annual symposium on Computational geometry, p.448-450, June 04-06, 1997, Nice, France
 
Jon M. Kleinberg, On-line search in a simple polygon, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.8-15, January 23-25, 1994, Arlington, Virginia, United States
Paul J. Heffernan, An optimal algorithm for the two-guard problem, Proceedings of the ninth annual symposium on Computational geometry, p.348-358, May 18-21, 1993, San Diego, California, United States
 
Gautam Das , Paul J. Heffernan , Giri Narasimhan, Finding all weakly-visible chords of a polygon in linear time, Nordic Journal of Computing, v.1 n.4, p.433-457, Winter 1994
Damien Pellier , Humbert Fiorino, Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, July 25-29, 2005, The Netherlands
Jae-Ha Lee , Sung Yong Shin , Kyung-Yong Chwa, Visibility-based pursuit-evasion in a polygonal room with a door, Proceedings of the fifteenth annual symposium on Computational geometry, p.281-290, June 13-16, 1999, Miami Beach, Florida, United States

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory


General Terms:
Algorithms

Collaborative Colleagues:
Christian Icking: colleagues
Rolf Klein: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player