On finding approximate optimal paths in weighted regions
From MaRDI portal
(Redirected from Publication:5468868)
Recommendations
- Adaptive and compact discretization for weighted region optimal path finding.
- An efficient approximation algorithm for weighted region shortest path problem
- Triangulation refinement and approximate shortest paths in weighted regions
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- The weighted region problem
Cited in
(33)- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- Pasting gauges. I: Shortest paths across a hyperplane
- Path refinement in weighted regions
- An (n^d) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- scientific article; zbMATH DE number 1614653 (Why is no real title available?)
- An efficient approximation algorithm for weighted region shortest path problem
- Shortest descending paths: towards an exact algorithm
- Approximate shortest homotopic paths in weighted regions
- A covering projection for robot navigation under strong anisotropy
- Navigating Weighted Regions with Scattered Skinny Tetrahedra
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- Fréchet distance problems in weighted regions
- Shortest Gently Descending Paths
- Line Segment Facility Location in Weighted Subdivisions
- Fastest-path planning for direction-dependent speed functions
- Path Planning in 0/1/∞ Weighted Regions with Applications
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- The weighted region problem
- scientific article; zbMATH DE number 2080988 (Why is no real title available?)
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- Navigating weighted regions with scattered skinny tetrahedra
- Computing an approximation of the 1-center problem on weighted terrain surfaces
- Line facility location in weighted regions
- Adaptive and compact discretization for weighted region optimal path finding.
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Path planning in a weighted planar subdivision under the Manhattan metric
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
- A survey of geodesic paths on 3D surfaces
- Computing shortest paths amid non-overlapping weighted disks
- Spanner for the 0/1/ weighted region problem
- Exact solutions to the weighted region problem
- Approximation algorithms for shortest descending paths in terrains
This page was built for publication: On finding approximate optimal paths in weighted regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5468868)