Querying Approximate Shortest Paths in Anisotropic Regions

DOI10.1137/080742166zbMath1207.68415OpenAlexW2127076644MaRDI QIDQ3053153

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

Publication date: 4 November 2010

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

Full work available at URL: https://doi.org/10.1137/080742166

zbMATH Keywords

shortest pathapproximation algorithmsconvex distance functionsanisotropic regions

Mathematics Subject Classification ID

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

Related Items (2)

Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Pasting gauges. I: Shortest paths across a hyperplane

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