Capture bounds for visibility-based pursuit evasion

DOI10.1145/2462356.2462364zbMath1305.68092OpenAlexW2121355379MaRDI QIDQ5174493

Kyle Klein, Subhash Suri

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2462356.2462364

zbMATH Keywords

upper boundlower boundconstrained Delaunay triangulationlion-and-man

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

The lion and man game on polyhedral surfaces with obstacles ⋮ Capture bounds for visibility-based pursuit evasion

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