k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
From MaRDI portal
Publication:4682198
DOI10.1142/S0218195999000315zbMATH Open1074.68647OpenAlexW2104671918MaRDI QIDQ4682198FDOQ4682198
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Maintenance of configurations in the plane
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Euclidean shortest paths in the presence of rectilinear barriers
- Optimal shortest path queries in a simple polygon
- Ray shooting in polygons using geodesic triangulations
- Computing minimum length paths of a given homotopy class
- Shortest Non-Crossing Rectilinear Paths in Plane Regions
Cited In (11)
- Non-crossing shortest paths lengths in planar graphs in linear time
- Thick non-crossing paths in a polygonal domain
- Constructing pairwise disjoint paths with few links
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- k-pairs non-crossing shortest paths in a simple polygon
- Title not available (Why is that?)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Non-crossing shortest paths lengths in planar graphs in linear time
- Thick non-crossing paths and minimum-cost flows in polygonal domains
- Shortest non-crossing walks in the plane
- The geodesic farthest-point Voronoi diagram 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)
