k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON

DOI10.1142/S0218195999000315MaRDI QIDQ4682198zbMATH OpenOpenAlexFDO

Authors Evanthia Papadopoulou

Publication date 10 June 2005

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195999000315

zbMATH Keywords

axis-parallel pathsgeodesic triangulationNon-crossing pathspolygon decompositionsimple polygon

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
• Thick non-crossing paths in a polygonal domain
• Geometric k Shortest Paths
• scientific article; zbMATH DE number 1256695

Cites work

• Computing minimum length paths of a given homotopy class
• Euclidean shortest paths in the presence of rectilinear barriers
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Maintenance of configurations in the plane
• 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

(11)

• The geodesic farthest-point Voronoi diagram in a simple polygon
• Thick non-crossing paths in a polygonal domain
• Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
• Constructing pairwise disjoint paths with few links
• Thick non-crossing paths and minimum-cost flows in polygonal domains
• scientific article; zbMATH DE number 7559212 (Why is no real title available?)
• Shortest non-crossing walks in the plane
• Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
• Non-crossing shortest paths lengths in planar graphs in linear time
• Non-crossing shortest paths lengths in planar graphs in linear time
• k-pairs non-crossing shortest paths in a simple polygon

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 Q4682198)