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

DOI10.4230/LIPICS.SWAT.2018.6MaRDI QIDQ5116469zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• On Romeo and Juliet problems: minimizing distance-to-sight
• Watchman routes in the presence of a pair of convex polygons
• Shortest watchman routes in simple polygons
• scientific article; zbMATH DE number 426139
• Finding the shortest watchman route in a simple polygon

Cites work

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

Cited in

(2)

• On Romeo and Juliet problems: minimizing distance-to-sight
• Minimizing Distance-to-Sight in Polygonal Domains

This page was built for publication: On Romeo and Juliet problems: minimizing distance-to-sight

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