Hide-and-seek: algorithms for polygon walk problems

DOI10.1007/978-3-642-20877-5_48MaRDI QIDQ3010428zbMATH OpenOpenAlexFDO

Authors Chenglin Fan, Jun Luo, Atlas F. IV. Cook

Publication date 1 July 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-20877-5_48

Mathematics Subject Classification ID

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

Recommendations

• Hiding people in polygons
• The Two-Guard Polygon Walk Problem
• scientific article; zbMATH DE number 1754612
• Partially walking a polygon
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM

Cites work

• scientific article; zbMATH DE number 1424289 (Why is no real title available?)
• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On computing connected components of line segments
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• THE TWO GUARDS PROBLEM

Cited in

(1)

• The Two-Guard Polygon Walk Problem

This page was built for publication: Hide-and-seek: algorithms for polygon walk problems

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