Line-of-Sight Pursuit in Monotone and Scallop Polygons

DOI10.1142/S0218195919500122zbMath1461.91050arXiv1508.07603OpenAlexW3023015788MaRDI QIDQ5149564

Volkan Isler, Alana Shine, Zachary Keller, Lindsay Berry, Andrew Beveridge, Junyi Wang, Jane V. Butterfield

Publication date: 11 February 2021

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.07603

zbMATH Keywords

pursuit-evasionmonotone polygonsweepable polygon

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Capture bounds for visibility-based pursuit evasion
• A game of cops and robbers
• A framework for pursuit evasion games in
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Recognizing polygons, or how to spy
• On geodesic properties of polygons relevant to linear time triangulation
• The lion and man game on polyhedral surfaces with obstacles
• Vertex-to-vertex pursuit in a graph
• Capture pursuit games on unbounded domains
• GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
• Visibility-Based Pursuit-Evasion with Bounded Speed
• THE TWO GUARDS PROBLEM
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Two-Guard Walkability of Simple Polygons
• Pursuit-evasion in a two-dimensional domain
• Solution of David Gale's lion and man problem

This page was built for publication: Line-of-Sight Pursuit in Monotone and Scallop Polygons