Shortest path to a segment and quickest visibility queries

DOI10.20382/JOCG.V7I2A5MaRDI QIDQ2970466zbMATH OpenOpenAlexFDO

Authors Esther M. Arkin, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie, Alon Efrat

Publication date 30 March 2017

Full work available at URL https://doaj.org/article/6cabca0373824e5fa0efdfd870399d35

Mathematics Subject Classification ID

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

Recommendations

• Shortest path to a segment and quickest visibility queries
• Query-point visibility constrained shortest paths in simple polygons
• Shortest Path Queries in Polygonal Domains
• Shortest-Path Queries in Geometric Networks
• Optimal shortest path queries in a simple polygon
• Shortest paths for line segments
• SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
• Shortest paths with single point visibility constraint

Cited in

(13)

• Quickest visibility queries in polygonal domains
• On Romeo and Juliet problems: minimizing distance-to-sight
• Visiting a Polygon on the Optimal Way to a Query Point
• Quickest visibility queries in polygonal domains
• How to Keep an Eye on Small Things
• Minimizing Distance-to-Sight in Polygonal Domains
• On Romeo and Juliet problems: minimizing distance-to-sight
• Visualizing quickest visibility maps
• Shortest path to a segment and quickest visibility queries
• Approximation algorithms for the two-watchman route in a simple polygon
• Observation routes and external watchman routes
• Optimizing visibility-based search in polygonal domains
• Approximation algorithms for anchored multiwatchman routes

This page was built for publication: Shortest path to a segment and quickest visibility queries

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