Visibility-based pursuit-evasion in a polygonal environment
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Minimizing width in linear layoutsPublished by Springer Nature ,2005
- Finding an unpredictable target in a workspace with obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEMInternational Journal of Computational Geometry & Applications, 1995
- Randomization for robot tasks: Using dynamic programming in the space of knowledge statesAlgorithmica, 1993
- Recontamination does not help to search a graphJournal of the ACM, 1993
- Monotonicity in graph searchingJournal of Algorithms, 1991
- Optimum watchman routesInformation Processing Letters, 1988
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- A theorem on polygon cutting with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979