Determining approximate shortest paths on weighted polyhedral surfaces
From MaRDI portal
Publication:3546286
DOI10.1145/1044731.1044733zbMath1204.68255OpenAlexW2028769163WikidataQ62037476 ScholiaQ62037476MaRDI QIDQ3546286
Jörg-Rüdiger Sack, Lyudmil Aleksandrov, Anil Maheshwari
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
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (30)
SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM ⋮ Approximating Nearest Neighbor Distances ⋮ An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures ⋮ Unnamed Item ⋮ Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ An approximation algorithm for computing shortest paths in weighted 3-d domains ⋮ Shortest monotone descent path problem in polyhedral terrain ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Path planning in a weighted planar subdivision under the Manhattan metric ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ A parallel bio-inspired shortest path algorithm ⋮ A survey of geodesic paths on 3D surfaces ⋮ Shortest path problems on a polyhedral surface ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST ⋮ An Experimental Study of Weighted k-Link Shortest Path Algorithms ⋮ APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS ⋮ A note on the unsolvability of the weighted region shortest path problem ⋮ FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS ⋮ Line facility location in weighted regions ⋮ Approximation algorithms for shortest descending paths in terrains ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Shortest Gently Descending Paths ⋮ Region-restricted clustering for geographic data mining ⋮ Path refinement in weighted regions ⋮ Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications ⋮ Line Segment Facility Location in Weighted Subdivisions ⋮ Weighted minimum backward Fréchet distance ⋮ On discretization methods for approximating optimal paths in regions with direction-dependent costs
Uses Software
This page was built for publication: Determining approximate shortest paths on weighted polyhedral surfaces
