SEARCHING A POLYGONAL REGION FROM THE BOUNDARY

DOI10.1142/S0218195901000638zbMath1074.68654MaRDI QIDQ4682159

Yuichi Tazoe, Tiko Kameda, Ichiro Suzuki, Masafumi Yamashita

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

visibilitysearchpolygonal regionPursuit-evasion

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Sweeping simple polygons with the minimum number of chain guards ⋮ Searching for mobile intruders in circular corridors by two 1-searchers ⋮ An annotated bibliography on guaranteed graph searching ⋮ Hide-and-Seek: Algorithms for Polygon Walk Problems ⋮ A unified and efficient solution to the room search problem ⋮ CLEARING A POLYGON WITH TWO 1-SEARCHERS

Cites Work

• Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
• The Searchlight Scheduling Problem
• Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Two-Guard Walkability of Simple Polygons
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM