SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
From MaRDI portal
Publication:5687652
DOI10.1142/S0218195996000216zbMATH Open0860.68109OpenAlexW2167427782MaRDI QIDQ5687652FDOQ5687652
Authors: Joseph S. B. Mitchell 
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
Recommendations
- Shortest paths in the plane with polygonal obstacles
- Shortest paths in the plane with obstacle violations
- Shortest paths in the plane with obstacle violations
- Shortest paths in the plane with convex polygonal obstacles
- Finding a shortest pair of paths on the plane with obstacles and crossing areas
- A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS
- Computing shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Computing shortest paths in the plane with removable obstacles
- Minimum-link paths among obstacles in the plane
Cited In (59)
- Optimal Insertion of a Segment Highway in a City Metric
- All Farthest Neighbors in the Presence of Highways and Obstacles
- Euclidean shortest paths in the presence of rectilinear barriers
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Routing in polygonal domains
- Density-Based Clustering Based on Topological Properties of the Data Set
- A note on visibility-constrained Voronoi diagrams
- Approximate Euclidean shortest paths amid convex obstacles
- Visibility graphs and obstacle-avoiding shortest paths
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- Title not available (Why is that?)
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- Unobstructed shortest paths in polyhedral environments
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
- Shortest paths among transient obstacles
- Computing the geodesic centers of a polygonal domain
- Approximate Shortest Paths in Polygons with Violations
- Computational Science and Its Applications – ICCSA 2004
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- The shortest path AMID 3-D polyhedral obstacles
- Link Distance and Shortest Path Problems in the Plane
- Touring a sequence of disjoint polygons: complexity and extension
- Shortest paths without a map
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
- Finding shortest path in the presence of barriers: an alternate approach
- Fast numerical methods based on SDEs for several problems related to the shortest path
- Quickest visibility queries in polygonal domains
- The shortest path in a simple polygon with obstacles
- Computing shortest paths in the plane with removable obstacles
- Shortest paths in the plane with obstacle violations
- Searching shortest paths on a set of geometric objects
- Title not available (Why is that?)
- Computing shortest paths amid pseudodisks
- The transportation metric and related problems
- Routing among convex polygonal obstacles in the plane
- Shortest path planning for a tethered robot
- Euclidean shortest paths. Exact or approximate algorithms.
- Title not available (Why is that?)
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
- Shortest paths in the plane with polygonal obstacles
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Geodesic order types
- Fast optimal and bounded suboptimal Euclidean pathfinding
- Computation of arc length in the presence of barriers in networks
- Shortest paths in the plane with obstacle violations
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Shortest paths in Euclidean graphs
- The geodesic diameter of polygonal domains
- Querying two boundary points for shortest paths in a polygonal domain
- The Fastest Path Between Two Points, with a Symmetric Obstacle
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Maximal distortion of geodesic diameters in polygonal domains
- Application of the A\(^*\) algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
- An exact method for finding shortest routes on a sphere, avoiding obstacles
- Title not available (Why is that?)
- Visiting a Polygon on the Optimal Way to a Query Point
- Shortest paths in the plane with convex polygonal obstacles
This page was built for publication: SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687652)
