SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
From MaRDI portal
Publication:5687652
DOI10.1142/S0218195996000216zbMath0860.68109OpenAlexW2167427782MaRDI QIDQ5687652
Publication date: 13 April 1997
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195996000216
Related Items (29)
Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier ⋮ Computing the geodesic centers of a polygonal domain ⋮ Computation of arc length in the presence of barriers in networks ⋮ Touring a sequence of disjoint polygons: complexity and extension ⋮ Routing among convex polygonal obstacles in the plane ⋮ ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE ⋮ Finding shortest path in the presence of barriers: an alternate approach ⋮ The geodesic diameter of polygonal domains ⋮ Routing in polygonal domains ⋮ Shortest paths in the plane with obstacle violations ⋮ Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ A note on visibility-constrained Voronoi diagrams ⋮ Visiting a Polygon on the Optimal Way to a Query Point ⋮ Querying two boundary points for shortest paths in a polygonal domain ⋮ Optimal Insertion of a Segment Highway in a City Metric ⋮ Maximal distortion of geodesic diameters in polygonal domains ⋮ Shortest path planning for a tethered robot ⋮ Geodesic order types ⋮ Approximate Shortest Paths in Polygons with Violations ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ All Farthest Neighbors in the Presence of Highways and Obstacles ⋮ Unnamed Item ⋮ OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM ⋮ Quickest visibility queries in polygonal domains ⋮ The transportation metric and related problems ⋮ Computing an \(L_1\) shortest path among splinegonal obstacles in the plane ⋮ Shortest paths without a map ⋮ Routing in Polygonal Domains
This page was built for publication: SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
