SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
DOI10.1142/S0218195995000246zbMATH Open0838.68111OpenAlexW2166655837MaRDI QIDQ4858653FDOQ4858653
Authors: David Crass, Ichiro Suzuki, Masafumi Yamashita 
Publication date: 28 May 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195995000246
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Cited In (22)
- Searching a polygonal region by a group of stationary \(k\)-searchers
- Searching a Circular Corridor with Two Flashlights
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
- A unified and efficient solution to the room search problem
- Mobile sensor intrusion detection under any shape of curve
- An annotated bibliography on guaranteed graph searching
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- Finding all door locations that make a room searchable
- CLEARING A POLYGON WITH TWO 1-SEARCHERS
- An efficient algorithm for the three-guard problem
- On the domination search number
- Visibility-based pursuit-evasion in a polygonal environment
- Simple algorithms for searching a polygon with flashlights
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
- SEARCHING A ROOM BY TWO GUARDS
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
- Title not available (Why is that?)
- Searching for mobile intruders in circular corridors by two 1-searchers
- Studying the stochastic capturing of moving intruders by mobile sensors
- Searching for mobile intruders in a polygonal region by a group of mobile searchers
- Searching for a Mobile Intruder in a Polygonal Region
This page was built for publication: SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858653)
