Hide-and-Seek: Algorithms for Polygon Walk Problems

DOI10.1007/978-3-642-20877-5_48zbMath1331.68249OpenAlexW1529341441MaRDI QIDQ3010428

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)

Cites Work

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

This page was built for publication: Hide-and-Seek: Algorithms for Polygon Walk Problems