Capture bounds for visibility-based pursuit evasion

DOI10.1016/j.comgeo.2014.10.002zbMath1304.65107OpenAlexW2215779591MaRDI QIDQ482339

Subhash Suri, Kyle Klein

Publication date: 23 December 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.10.002

zbMATH Keywords

upper boundlower boundconstrained Delaunay triangulationlion-and-man

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Formulation of a cooperative-confinement-escape problem of multiple cooperative defenders against an evader escaping from a circular region ⋮ Line-of-Sight Pursuit in Monotone and Scallop Polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for pursuit evasion games in
• Graph searching and a min-max theorem for tree-width
• The complexity of searching a graph
• On the Problem of Partitioning Planar Graphs
• Searching for a Mobile Intruder in a Polygonal Region
• “Lion and Man”: Upper and Lower Bounds
• Capture bounds for visibility-based pursuit evasion
• Solution of David Gale's lion and man problem

This page was built for publication: Capture bounds for visibility-based pursuit evasion