Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
From MaRDI portal
Publication:2583537
DOI10.1016/S0020-0190(98)00029-5zbMath1077.68918MaRDI 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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
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, Searching a polygonal region by a group of stationary \(k\)-searchers, The searchlight problem for road networks, Mobile sensor intrusion detection under any shape of curve, CLEARING A POLYGON WITH TWO 1-SEARCHERS
Cites Work