An Optimal Algorithm for Euclidean Shortest Paths in the Plane
From MaRDI portal
Recommendations
Cited in
(90)- Precision-Sensitive Euclidean Shortest Path in 3-Space
- Pursuit-evasion games in the presence of obstacles
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures
- On geometric path query problems
- Shortest rectilinear path queries to rectangles in a rectangular domain
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- scientific article; zbMATH DE number 7559259 (Why is no real title available?)
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Rectilinear link diameter and radius in a rectilinear polygonal domain
- Routing in polygonal domains
- A note on visibility-constrained Voronoi diagrams
- An optimal-time algorithm for shortest paths on realistic polyhedra
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Shortest-Path Queries in Geometric Networks
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- A new algorithm for Euclidean shortest paths in the plane
- \(L_{1}\) cheapest paths in ``Fjord scenery
- Shortest paths among transient obstacles
- Curves that must be retraced
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Lower bounds for computing geometric spanners and approximate shortest paths
- Computing the geodesic centers of a polygonal domain
- Approximate Shortest Paths in Polygons with Violations
- Geodesic-preserving polygon simplification
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- The shortest path AMID 3-D polyhedral obstacles
- ON GEOMETRIC PATH QUERY PROBLEMS
- Geodesics in CAT(0) cubical complexes
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles
- Touring a sequence of disjoint polygons: complexity and extension
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
- Shortest paths in simple polygons with polygon-meet constraints
- Link Distance and Shortest Path Problems in the Plane
- Maximum thick paths in static and dynamic environments
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Quickest visibility queries in polygonal domains
- How to Keep an Eye on Small Things
- Convex hulls in polygonal domains
- Rectilinear link diameter and radius in a rectilinear polygonal domain
- Shortest Path Problems on a Polyhedral Surface
- Computing shortest paths in the plane with removable obstacles
- Shortest Path Queries in Polygonal Domains
- Shortest paths in the plane with obstacle violations
- Approximation algorithms for shortest descending paths in terrains
- Shortest path problems on a polyhedral surface
- Kinetic geodesic Voronoi diagrams in a simple polygon
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- The transportation metric and related problems
- Shortest path planning for a tethered robot
- An exact geometry-based algorithm for path planning
- Routing among convex polygonal obstacles in the plane
- Minimizing Distance-to-Sight in Polygonal Domains
- Euclidean shortest paths. Exact or approximate algorithms.
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Link distance and shortest path problems in the plane
- A novel approach for modeling order picking paths
- Minimum Cell Connection in Line Segment Arrangements
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Shortest paths in the plane with obstacle violations
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles
- A wavefront approach to center location problems with barriers
- Shortest Journeys in Directed Temporal Graphs
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Enclosing points with geometric objects
- Towards space efficient two-point shortest path queries in a polygonal domain
- Flying over a polyhedral terrain
- Asynchronous deterministic rendezvous in bounded terrains
- The geodesic diameter of polygonal domains
- Shortest paths in Euclidean graphs
- Querying two boundary points for shortest paths in a polygonal domain
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Planar rectilinear shortest path computation using corridors
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Maximal distortion of geodesic diameters in polygonal domains
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
- Honey-pot constrained searching with local sensory information
- Navigating weighted regions with scattered skinny tetrahedra
- Reachable region query and its applications
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Visiting a Polygon on the Optimal Way to a Query Point
- Shortest descending paths: towards an exact algorithm
- Computing shortest paths amid non-overlapping weighted disks
This page was built for publication: An Optimal Algorithm for Euclidean Shortest Paths in the Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268866)
