Quickest visibility queries in polygonal domains

DOI10.4230/LIPICS.SOCG.2017.61zbMATH Open1423.68558MaRDI QIDQ4580139FDOQ4580139

Authors: Haitao Wang 

Publication date: 13 August 2018

Recommendations

• Quickest visibility queries in polygonal domains
• Visibility queries in a polygonal region
• Shortest path to a segment and quickest visibility queries
• Shortest path to a segment and quickest visibility queries
• Visualizing quickest visibility maps

zbMATH Keywords

shortest pathsvisibilitypolygons with holesquickest visibility queriesshortest path to segments

Mathematics Subject Classification ID

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

Cited In (11)

• Visibility queries in a polygonal region
• On Romeo and Juliet problems: minimizing distance-to-sight
• On Romeo and Juliet problems: minimizing distance-to-sight
• Visualizing quickest visibility maps
• Quickest visibility queries in polygonal domains
• Shortest Path Queries in Polygonal Domains
• Shortest path to a segment and quickest visibility queries
• Minimizing Distance-to-Sight in Polygonal Domains
• Visibility and Ray Shooting Queries in Polygonal Domains
• Shortest path solves edge-to-edge visibility in a polygon
• Visibility queries and maintenance in simple polygons

This page was built for publication: Quickest visibility queries in polygonal domains

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