On Romeo and Juliet problems: minimizing distance-to-sight

DOI10.1016/j.comgeo.2019.07.003zbMath1468.68257arXiv1906.01114OpenAlexW2966831074MaRDI QIDQ2331220

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

Publication date: 25 October 2019

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.01114

zbMATH Keywords

shortest pathvisibility polygonwatchman problems

Mathematics Subject Classification ID

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

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
• 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