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

DOI10.1016/S0020-0190(98)00029-5MaRDI QIDQ2583537zbMATH OpenOpenAlexFDO

Authors Ichiro Suzuki, Masafumi Yamashita, H. Umemoto, Tsunehiko Kameda

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)

Cites work

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

Cited in

(7)

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

This page was built for publication: Bushiness and a tight worst-case upper bound on the search number of a simple polygon.

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