Hide-and-seek: algorithms for polygon walk problems

DOI10.1007/978-3-642-20877-5_48zbMATH Open1331.68249OpenAlexW1529341441MaRDI QIDQ3010428FDOQ3010428

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

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

Mathematics Subject Classification ID

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

Cites Work

• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Title not available (Why is that?)
• Title not available (Why is that?)
• On computing connected components of line segments
• THE TWO GUARDS PROBLEM
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable

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)