Bushiness and a tight worst-case upper bound on the search number of a simple polygon.

DOI10.1016/S0020-0190(98)00029-5zbMath1077.68918OpenAlexW2005906554MaRDI QIDQ2583537

Hideki Umemoto, Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00029-5

zbMATH Keywords

Computational geometrySearch numberWorst-case boundBushinessPolygon search

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Searching a polygonal region by a group of stationary \(k\)-searchers ⋮ Studying the stochastic capturing of moving intruders by mobile sensors ⋮ Mobile sensor intrusion detection under any shape of curve ⋮ SEARCHING A POLYGONAL REGION FROM THE BOUNDARY ⋮ SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER ⋮ CLEARING A POLYGON WITH TWO 1-SEARCHERS ⋮ The searchlight problem for road networks

Cites Work

• The complexity of searching a graph
• Searching for a Mobile Intruder in a Polygonal Region
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Searching for mobile intruders in a polygonal region by a group of mobile searchers