k-pairs non-crossing shortest paths in a simple polygon

DOI10.1007/BFB0009507zbMath1512.6842MaRDI QIDQ6487450

Evanthia Papadopoulou

Publication date: 25 January 2023

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Computing minimum length paths of a given homotopy class
• Ray shooting in polygons using geodesic triangulations
• Optimal shortest path queries in a simple polygon
• Euclidean shortest paths in the presence of rectilinear barriers
• Shortest Non-Crossing Rectilinear Paths in Plane Regions

This page was built for publication: k-pairs non-crossing shortest paths in a simple polygon