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

DOI10.1007/BFB0009507MaRDI QIDQ6487450zbMATH OpenFDO

Authors Evanthia Papadopoulou

Publication date 25 January 2023

Full work available at URL https://doi.org/10.1007/BFB0009507

Mathematics Subject Classification ID

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

Recommendations

• k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
• Shortest non-crossing walks in the plane
• Geometric k Shortest Paths
• scientific article; zbMATH DE number 1256695
• A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS

Cites work

• Computing minimum length paths of a given homotopy class
• Euclidean shortest paths in the presence of rectilinear barriers
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Optimal shortest path queries in a simple polygon
• Ray shooting in polygons using geodesic triangulations
• Shortest Non-Crossing Rectilinear Paths in Plane Regions

Cited in

(3)

• Thick non-crossing paths in a polygonal domain
• k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
• Shortest non-crossing walks in the plane

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

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