Pages that link to "Item:Q4268866"
From MaRDI portal
The following pages link to An Optimal Algorithm for Euclidean Shortest Paths in the Plane (Q4268866):
Displaying 50 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- The geodesic diameter of polygonal domains (Q368771) (← links)
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- Shortest path problems on a polyhedral surface (Q472466) (← links)
- Curves that must be retraced (Q550254) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges (Q634247) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Geodesics in CAT(0) cubical complexes (Q651054) (← links)
- \(L_{1}\) cheapest paths in ``Fjord scenery'' (Q706968) (← links)
- A wavefront approach to center location problems with barriers (Q816405) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Shortest path planning for a tethered robot (Q904114) (← links)
- Pursuit-evasion games in the presence of obstacles (Q905769) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach (Q1022450) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- The transportation metric and related problems (Q1041811) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
- The shortest path AMID 3-D polyhedral obstacles (Q2073355) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Shortest paths among transient obstacles (Q2156288) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Reachable region query and its applications (Q2201650) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach (Q2252135) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Flying over a polyhedral terrain (Q2380051) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Honey-pot constrained searching with local sensory information (Q2507866) (← links)
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM (Q2893462) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- Shortest Path Problems on a Polyhedral Surface (Q3183449) (← links)
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- Shortest Path Queries in Polygonal Domains (Q3511429) (← links)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges (Q3611849) (← links)
- Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS (Q4650092) (← links)
