Searching for a Mobile Intruder in a Polygonal Region
- 1 October 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (5), 863-888
- https://doi.org/10.1137/0221051
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Triangulating a simple polygon in linear timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The complexity of searching a graphJournal of the ACM, 1988
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Computational complexity of art gallery problemsIEEE Transactions on Information Theory, 1986
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Traditional Galleries Require Fewer WatchmenSIAM Journal on Algebraic Discrete Methods, 1983
- Stabbing line segmentsBIT Numerical Mathematics, 1982
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975