Determining approximate shortest paths on weighted polyhedral surfaces
From MaRDI portal
Publication:3546286
Recommendations
- Fundamentals of Computation Theory
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Approximating shortest paths on weighted polyhedral surfaces
- Approximate shortest path on a polyhedral surface and its applications
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
Cited in
(37)- Weighted minimum backward Fréchet distance
- Region-restricted clustering for geographic data mining
- Shortest path problems on a polyhedral surface
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- Path planning in a weighted planar subdivision under the Manhattan metric
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- Fréchet distance problems in weighted regions
- A parallel bio-inspired shortest path algorithm
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Line facility location in weighted regions
- A note on the unsolvability of the weighted region shortest path problem
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
- Path refinement in weighted regions
- Pasting gauges. I: Shortest paths across a hyperplane
- On approximating shortest paths in weighted triangular tessellations
- On approximating shortest paths in weighted triangular tessellations
- An experimental study of weighted \(k\)-link shortest path algorithms
- Navigating weighted regions with scattered skinny tetrahedra
- Approximation algorithms for shortest descending paths in terrains
- Line Segment Facility Location in Weighted Subdivisions
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- A survey of geodesic paths on 3D surfaces
- Computational Science and Its Applications – ICCSA 2004
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Shortest monotone descent path problem in polyhedral terrain
- Shortest descending paths: towards an exact algorithm
- Approximating shortest paths on weighted polyhedral surfaces
- Shortest Gently Descending Paths
- Approximating nearest neighbor distances
This page was built for publication: Determining approximate shortest paths on weighted polyhedral surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546286)
