Triangulation Refinement and Approximate Shortest Paths in Weighted Regions
From MaRDI portal
Publication:5363017
DOI10.1137/1.9781611973730.108zbMath1371.68289OpenAlexW4254394386MaRDI QIDQ5363017
Antoine Vigneron, Jiongxin Jin, Siu-Wing Cheng
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.108
Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (4)
An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures ⋮ Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ On approximating shortest paths in weighted triangular tessellations
This page was built for publication: Triangulation Refinement and Approximate Shortest Paths in Weighted Regions
