SEARCHING A POLYGONAL REGION FROM THE BOUNDARY

DOI10.1142/S0218195901000638zbMATH Open1074.68654MaRDI QIDQ4682159FDOQ4682159

Authors: Ichiro Suzuki, Yuichi Tazoe, Tiko Kameda, Masafumi Yamashita 

Publication date: 10 June 2005

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

Recommendations

• Combinatorial Geometry and Graph Theory
• Searching for a Mobile Intruder in a Polygonal Region
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• scientific article; zbMATH DE number 2080272
• scientific article; zbMATH DE number 1754612

zbMATH Keywords

searchvisibilitypolygonal regionPursuit-evasion

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Characterization of boundary 1-searchers for polygons
• Searching a polygonal region by a group of stationary \(k\)-searchers
• A unified and efficient solution to the room search problem
• Title not available (Why is that?)
• An alternative proof for the equivalence of searcher and 2-searcher
• An annotated bibliography on guaranteed graph searching
• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• Searching a Polygonal Region by Two Guards
• Hide-and-seek: algorithms for polygon walk problems
• Combinatorial Geometry and Graph Theory
• Searching polyhedra by rotating half-planes
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• The Searchlight Scheduling Problem
• Searching for mobile intruders in circular corridors by two 1-searchers
• Sweeping simple polygons with the minimum number of chain guards
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• Algorithms – ESA 2004
• Searching for a Mobile Intruder in a Polygonal Region

This page was built for publication: SEARCHING A POLYGONAL REGION FROM THE BOUNDARY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682159)