The two-guard problem on curvilinear polygons

DOI10.23952/JNVA.9.2025.1.01MaRDI QIDQ7023411zbMATH OpenFDO

Authors Yiming Wang, Sergiy Butenko

Publication date 21 February 2025

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/JNVA.9.2025.1.01

zbMATH Keywords

curvilinear polygonpiecewise locally convex polygontwo-guard problemvisibility

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Combinatorial Geometry and Graph Theory
• Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
• scientific article; zbMATH DE number 3774429 (Why is no real title available?)
• scientific article; zbMATH DE number 2080273 (Why is no real title available?)
• scientific article; zbMATH DE number 1786527 (Why is no real title available?)
• scientific article; zbMATH DE number 1834577 (Why is no real title available?)
• Meeting in a polygon by anonymous oblivious robots
• Optimal shortest path queries in a simple polygon
• Partially walking a polygon
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• SEARCHING A ROOM BY TWO GUARDS
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• Two-Guard Walkability of Simple Polygons
• Visibility Algorithms in the Plane

This page was built for publication: The two-guard problem on curvilinear polygons

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