Partially Walking a Polygon

DOI10.4230/LIPICS.ISAAC.2018.60MaRDI QIDQ5091053zbMATH OpenOpenAlexFDO

Authors Franz Aurenhammer, Michael Steinkogler, Rolf Klein

Publication date 21 July 2022

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2018/10008/pdf/LIPIcs-ISAAC-2018-60.pdf

zbMATH Keywords

guard walkpolygonvisibility

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1834577 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• On triangulation axes of polygons
• Optimal shortest path queries in a simple polygon
• Ray shooting in polygons using geodesic triangulations
• THE TWO GUARDS PROBLEM
• Two-Guard Walkability of Simple Polygons

Cited in

(1)

• WALKING IN A TRIANGULATION

This page was built for publication: Partially Walking a Polygon

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