Approximating shortest paths on weighted polyhedral surfaces

DOI10.1007/S00453-001-0027-5MaRDI QIDQ5940611zbMATH OpenOpenAlexFDO

Authors M. Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack

Publication date 9 August 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0027-5

zbMATH Keywords

euclidean shortest pathpolyhedronTINweighted shortest path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40) Programming involving graphs or networks (90C35)

Recommendations

• Determining approximate shortest paths on weighted polyhedral surfaces
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Fundamentals of Computation Theory
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Approximation algorithms for geometric shortest path problems

Cited in

(27)

• On discretization methods for approximating optimal paths in regions with direction-dependent costs
• Path refinement in weighted regions
• An external memory data structure for shortest path queries
• Discrete Lagrangian algorithm for finding geodesics on triangular meshes
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
• An approximation algorithm for computing shortest paths in weighted 3-d domains
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Approximating shortest paths on a nonconvex polyhedron
• Determining approximate shortest paths on weighted polyhedral surfaces
• An experimental study of weighted \(k\)-link shortest path algorithms
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• Density-Based Clustering Based on Topological Properties of the Data Set
• Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
• Fast query structures in anisotropic media
• Approximating generalized distance functions on weighted triangulated surfaces with applications
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Approximate Shortest Paths in Polygons with Violations
• Shortest paths on polyhedral surfaces and terrains
• Navigating weighted regions with scattered skinny tetrahedra
• Computing an approximation of the 1-center problem on weighted terrain surfaces
• Computational Science and Its Applications – ICCSA 2004
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• A survey of geodesic paths on 3D surfaces
• Robust radial basis function interpolation based on geodesic distance for the numerical coupling of multiphysics problems
• An optimal-time algorithm for shortest paths on realistic polyhedra
• Shortest monotone descent path problem in polyhedral terrain

This page was built for publication: Approximating 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 Q5940611)