k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
From MaRDI portal
Publication:4682198
DOI10.1142/S0218195999000315zbMath1074.68647MaRDI QIDQ4682198
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
polygon decomposition; simple polygon; geodesic triangulation; axis-parallel paths; Non-crossing paths
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Unnamed Item, 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, 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
Cites Work
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Maintenance of configurations in the plane
- 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