Shortest paths with single point visibility constraint

MaRDI QIDQ3535949zbMATH OpenFDO

Authors Ramtin Khosravi, Mohammad Ghodsi

Publication date 17 November 2008

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Query-point visibility constrained shortest paths in simple polygons
• Query-points visibility constraint minimum link paths in simple polygons
• Shortest paths in simple polygons with polygon-meet constraints
• Visiting a Polygon on the Optimal Way to a Query Point
• Shortest path solves edge-to-edge visibility in a polygon

Cited in

(4)

• Shortest path to a segment and quickest visibility queries
• Shortest paths in simple polygons with polygon-meet constraints
• Query-points visibility constraint minimum link paths in simple polygons
• Query-point visibility constrained shortest paths in simple polygons

This page was built for publication: Shortest paths with single point visibility constraint

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