Triangulation refinement and approximate shortest paths in weighted regions

DOI10.1137/1.9781611973730.108MaRDI QIDQ5363017zbMATH OpenOpenAlexFDO

Authors Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• The weighted region problem
• Approximate Shortest Paths in Anisotropic Regions
• An efficient approximation algorithm for weighted region shortest path problem
• Navigating Weighted Regions with Scattered Skinny Tetrahedra
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces

Cited in

(12)

• Path refinement in weighted regions
• An (n^d) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures
• On approximating shortest paths in weighted triangular tessellations
• An efficient approximation algorithm for weighted region shortest path problem
• Navigating Weighted Regions with Scattered Skinny Tetrahedra
• The weighted region problem
• APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
• IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
• Navigating weighted regions with scattered skinny tetrahedra
• On finding approximate optimal paths in weighted regions
• On approximating shortest paths in weighted triangular tessellations
• Spanner for the 0/1/ weighted region problem

This page was built for publication: Triangulation refinement and approximate shortest paths in weighted regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363017)