Approximate Shortest Paths in Anisotropic Regions

DOI10.1137/06067777XzbMath1187.68636MaRDI QIDQ3631892

Siu-Wing Cheng, Yajun Wang, Antoine Vigneron, Hyeon-Suk Na

Publication date: 22 June 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

shortest pathapproximation algorithmweighted regioncomputational geometryconvex distance function

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (9)

Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Fastest-path planning for direction-dependent speed functions ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Fast query structures in anisotropic media ⋮ A survey of geodesic paths on 3D surfaces ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Approximate Shortest Paths in Polygons with Violations ⋮ APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS ⋮ Line Segment Facility Location in Weighted Subdivisions

This page was built for publication: Approximate Shortest Paths in Anisotropic Regions