Query-point visibility constrained shortest paths in simple polygons

DOI10.1016/J.TCS.2007.07.003zbMATH Open1143.68065OpenAlexW2146181477MaRDI QIDQ2465622FDOQ2465622

Authors: Ramtin Khosravi, Mohammad Ghodsi 

Publication date: 7 January 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.003

Recommendations

• Query-points visibility constraint minimum link paths in simple polygons
• Shortest path solves edge-to-edge visibility in a polygon
• Shortest paths with single point visibility constraint
• Efficient visibility queries in simple polygons
• Shortest path to a segment and quickest visibility queries

zbMATH Keywords

computational geometryshortest pathvisibility

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for TSP with neighborhoods in the plane
• Optimal Search in Planar Subdivisions
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Fast Algorithms for Finding Nearest Common Ancestors
• Touring a sequence of polygons
• Shortest watchman routes in simple polygons
• Watchman routes under limited visibility
• Corrections to Lee's visibility polygon algorithm
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Approximation algorithms for the watchman route and zookeeper's problems.
• Finding shortest safari routes in simple polygons
• The zookeeper route problem
• Visibility of a simple polygon
• Shortest paths in simple polygons with polygon-meet constraints
• Shortest paths with single point visibility constraint

Cited In (10)

• Shortest path to a segment and quickest visibility queries
• Optimal shortest path queries in a simple polygon
• Visualizing quickest visibility maps
• Computing simple paths from given points inside a polygon
• How to Keep an Eye on Small Things
• Shortest paths with single point visibility constraint
• Query-points visibility constraint minimum link paths in simple polygons
• Shortest path to a segment and quickest visibility queries
• Shortest path solves edge-to-edge visibility in a polygon
• Visiting a Polygon on the Optimal Way to a Query Point

This page was built for publication: Query-point visibility constrained shortest paths in simple polygons

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