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

DOI10.4230/LIPICS.SWAT.2018.6zbMATH Open1468.68258OpenAlexW2963859412MaRDI QIDQ5116469FDOQ5116469

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) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

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

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)