Partially walking a polygon

DOI10.1016/J.COMGEO.2019.07.002MaRDI QIDQ2331219zbMATH OpenOpenAlexFDO

Authors Michael Steinkogler, Franz Aurenhammer, Rolf Klein

Publication date 25 October 2019

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2018/10008/

zbMATH Keywords

polygontriangulation axistwo-guard walks

Mathematics Subject Classification ID

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

Recommendations

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

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
• Two-Guard Walkability of Simple Polygons

Cited in

(7)

• Hide-and-seek: algorithms for polygon walk problems
• WALKING IN A TRIANGULATION
• Two-Guard Walkability of Simple Polygons
• scientific article; zbMATH DE number 1834577 (Why is no real title available?)
• Partially Walking a Polygon
• Walkability in polygons by two guards: a revisit
• The two-guard problem on curvilinear polygons

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 Q2331219)