On Romeo and Juliet Problems: Minimizing Distance-to-Sight.

DOI10.4230/LIPIcs.SWAT.2018.6zbMath1468.68258OpenAlexW2963859412MaRDI QIDQ5116469

Hee-Kap Ahn, Eunjin Oh, Darren Strash, Fabian Stehn, Lena Schlipf

Publication date: 25 August 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/swat/swat2018.html#Ahn0SSS18

zbMATH Keywords

shortest-pathvisibility polygonwatchman problems

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

Minimizing Distance-to-Sight in Polygonal Domains

Cites Work

• Unnamed Item
• Watchman tours for polygons with holes
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Optimum watchman routes
• A new data structure for shortest path queries in a simple polygon
• Visibility queries and maintenance in simple polygons
• Finding the shortest watchman route in a simple polygon
• Optimal shortest path queries in a simple polygon
• Shortest path to a segment and quickest visibility queries
• Touring a sequence of polygons
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Approximating Watchman Routes

This page was built for publication: On Romeo and Juliet Problems: Minimizing Distance-to-Sight.