Optimal algorithms for two-guard walkability of simple polygons

DOI10.1007/3-540-44634-6_40MaRDI QIDQ4779120zbMATH OpenFDO

Authors Binay Bhattacharya, Giri Narasimhan, Asish Mukhopadhyay

Publication date 24 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44634-6_40

Mathematics Subject Classification ID

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

Recommendations

• Two-Guard Walkability of Simple Polygons
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• The Two-Guard Polygon Walk Problem
• Walkability in polygons by two guards: a revisit
• Partially walking a polygon

Cited in

(14)

• An efficient algorithm for the three-guard problem
• Partially walking a polygon
• Optimum sweeps of simple polygons with two guards
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Characterizing and recognizing LR-visibility polygons
• A unified and efficient solution to the room search problem
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• The Two-Guard Polygon Walk Problem
• Two-Guard Walkability of Simple Polygons
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Partially Walking a Polygon
• Walkability in polygons by two guards: a revisit
• The two-guard problem on curvilinear polygons
• Sweeping a domain with line-of-sight between covisible agents

This page was built for publication: Optimal algorithms for two-guard walkability of simple polygons

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