SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
From MaRDI portal
Publication:4858653
DOI10.1142/S0218195995000246zbMath0838.68111OpenAlexW2166655837MaRDI QIDQ4858653
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Related Items (17)
Searching a polygonal region by a group of stationary \(k\)-searchers ⋮ AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT ⋮ SEARCHING A ROOM BY TWO GUARDS ⋮ Studying the stochastic capturing of moving intruders by mobile sensors ⋮ Visibility-based pursuit-evasion in a polygonal environment ⋮ A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable ⋮ Mobile sensor intrusion detection under any shape of curve ⋮ An annotated bibliography on guaranteed graph searching ⋮ FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE ⋮ A unified and efficient solution to the room search problem ⋮ SEARCHING A POLYGONAL REGION FROM THE BOUNDARY ⋮ SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER ⋮ An efficient algorithm for the three-guard problem ⋮ CLEARING A POLYGON WITH TWO 1-SEARCHERS ⋮ On the domination search number ⋮ Simple algorithms for searching a polygon with flashlights ⋮ Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
This page was built for publication: SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
