Algorithms for approximate shortest path queries on weighted polyhedral surfaces
DOI10.1007/S00454-009-9204-0zbMATH Open1207.68411OpenAlexW2074682596WikidataQ62037452 ScholiaQ62037452MaRDI QIDQ603866FDOQ603866
Authors: Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack 
Publication date: 8 November 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9204-0
Recommendations
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
- Determining approximate shortest paths on weighted polyhedral surfaces
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Approximating shortest paths on weighted polyhedral surfaces
- Computing approximate shortest paths on convex polytopes
shortest pathSteiner pointsseparatorapproximation graphquery algorithmweighted polyhedral surfaceweighted surface partioning
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)
Cites Work
- A Separator Theorem for Planar Graphs
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- The Discrete Geodesic Problem
- On Shortest Paths in Polyhedral Spaces
- Additivity of the genus of a graph
- The weighted region problem
- A separator theorem for graphs of bounded genus
- Optimal shortest path queries in a simple polygon
- Approximate Shortest Paths in Anisotropic Regions
- Title not available (Why is that?)
- Star Unfolding of a Polytope with Applications
- On finding approximate optimal paths in weighted regions
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Title not available (Why is that?)
- Determining approximate shortest paths on weighted polyhedral surfaces
- Partitioning planar graphs with vertex costs: Algorithms and applications
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
- Metric entropy of some classes of sets with differentiable boundaries
- Computing approximate shortest paths on convex polytopes
- Approximating shortest paths on a convex polytope in three dimensions
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Sublinear Geometric Algorithms
- Querying approximate shortest paths in anisotropic regions
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- An efficient approximation algorithm for weighted region shortest path problem
- Partitioning planar graphs with costs and weights
- Title not available (Why is that?)
- ON GEOMETRIC PATH QUERY PROBLEMS
- Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
- Fundamentals of Computation Theory
Cited In (16)
- Fast query structures in anisotropic media
- Approximate Shortest Path Queries Using Voronoi Duals
- A survey of geodesic paths on 3D surfaces
- Approximating shortest paths on weighted polyhedral surfaces
- Line facility location in weighted regions
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- Subdivision surface fitting to a dense mesh using ridges and umbilics
- Approximate distance queries for weighted polyhedral surfaces
- Similarity of polygonal curves in the presence of outliers
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
- Path planning in a weighted planar subdivision under the Manhattan metric
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
- Determining approximate shortest paths on weighted polyhedral surfaces
- Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\)
This page was built for publication: Algorithms for approximate shortest path queries on weighted polyhedral surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603866)
