Two-Guard Walkability of Simple Polygons

DOI10.1142/S0218195998000060MaRDI QIDQ4513202zbMATH OpenFDO

Authors

Publication date 7 November 2000

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

Full work available at URL https://doi.org/10.1142/S0218195998000060

zbMATH Keywords

walk

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1834577
• Walkability in polygons by two guards: a revisit
• The Two-Guard Polygon Walk Problem
• Partially walking a polygon
• THE TWO GUARDS PROBLEM

Cites work

• An optimal visibility graph algorithm for triangulated simple polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Minimum Cuts for Circular-Arc Graphs

Cited in

(23)

• An efficient algorithm for the three-guard problem
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• Partially walking a polygon
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Characterizing and recognizing LR-visibility polygons
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Finding all door locations that make a room searchable
• CLEARING A POLYGON WITH TWO 1-SEARCHERS
• The Two-Guard Polygon Walk Problem
• EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• scientific article; zbMATH DE number 1834577 (Why is no real title available?)
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
• Finding all weakly-visible chords of a polygon in linear time
• Partially Walking a Polygon
• On hamiltonian triangulations in simple polygons (Extended Abstract)
• Line-of-sight pursuit in monotone and scallop polygons
• Walkability in polygons by two guards: a revisit
• Characterizing LR-visibility polygons and related problems
• LR-visibility in polygons
• The two-guard problem on curvilinear polygons

This page was built for publication: 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 Q4513202)