Approximate Shortest Paths in Anisotropic Regions
From MaRDI portal
Recommendations
Cited in
(16)- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- Pasting gauges. I: Shortest paths across a hyperplane
- Approximate shortest paths in anisotropic regions
- Querying Approximate Shortest Paths in Anisotropic Regions
- Querying approximate shortest paths in anisotropic regions
- Line Segment Facility Location in Weighted Subdivisions
- Fastest-path planning for direction-dependent speed functions
- Fast query structures in anisotropic media
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- Approximate Shortest Paths in Polygons with Violations
- Quickest paths in anisotropic media
- Triangulation refinement and approximate shortest paths in weighted regions
- Navigating weighted regions with scattered skinny tetrahedra
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- A survey of geodesic paths on 3D surfaces
- Path planning with divergence-based distance functions
This page was built for publication: Approximate Shortest Paths in Anisotropic Regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631892)