Determining approximate shortest paths on weighted polyhedral surfaces
DOI10.1145/1044731.1044733zbMATH Open1204.68255OpenAlexW2028769163WikidataQ62037476 ScholiaQ62037476MaRDI QIDQ3546286FDOQ3546286
Authors: Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack 
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1044731.1044733
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
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (37)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Pasting gauges. I: Shortest paths across a hyperplane
- A survey of geodesic paths on 3D surfaces
- Approximating shortest paths on weighted polyhedral surfaces
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- Line facility location in weighted regions
- Line Segment Facility Location in Weighted Subdivisions
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- A parallel bio-inspired shortest path algorithm
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- On approximating shortest paths in weighted triangular tessellations
- Approximating nearest neighbor distances
- Title not available (Why is that?)
- Computational Science and Its Applications – ICCSA 2004
- Region-restricted clustering for geographic data mining
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Path planning in a weighted planar subdivision under the Manhattan metric
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- On approximating shortest paths in weighted triangular tessellations
- Shortest monotone descent path problem in polyhedral terrain
- Approximation algorithms for shortest descending paths in terrains
- Shortest path problems on a polyhedral surface
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
- An experimental study of weighted \(k\)-link shortest path algorithms
- Shortest Gently Descending Paths
- Weighted minimum backward Fréchet distance
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
- A note on the unsolvability of the weighted region shortest path problem
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- Fréchet distance problems in weighted regions
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Navigating weighted regions with scattered skinny tetrahedra
- Path refinement in weighted regions
- Shortest descending paths: towards an exact algorithm
Uses Software
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)
