Navigating weighted regions with scattered skinny tetrahedra

DOI10.1142/S0218195917600020zbMATH Open1372.68257OpenAlexW2754203313MaRDI QIDQ5370569FDOQ5370569

Authors Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron 

Publication date 20 October 2017

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195917600020

zbMATH Keywords

approximation algorithmshortest pathweighted region

Mathematics Subject Classification ID

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

Recommendations

• Navigating Weighted Regions with Scattered Skinny Tetrahedra
• An approximation algorithm for computing shortest paths in weighted 3-d domains
• The weighted region problem
• Triangulation refinement and approximate shortest paths in weighted regions
• Approximation algorithms for geometric shortest path problems

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1391661 (Why is no real title available?)
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• An algorithm for shortest-path motion in three dimensions
• An approximation algorithm for computing shortest paths in weighted 3-d domains
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Approximate Shortest Paths in Anisotropic Regions
• Approximate shortest descending paths
• Approximating shortest paths on weighted polyhedral surfaces
• Approximation algorithms for shortest descending paths in terrains
• Computing shortest paths among curved obstacles in the plane
• Constructing Approximate Shortest Path Maps in Three Dimensions
• Determining approximate shortest paths on weighted polyhedral surfaces
• Fibonacci heaps and their uses in improved network optimization algorithms
• Geophysical data analysis: Discrete inverse theory. MATLAB edition.
• New results on shortest paths in three dimensions
• On finding approximate optimal paths in weighted regions
• Querying Approximate Shortest Paths in Anisotropic Regions
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Shortest descending paths through given faces
• Shortest descending paths: towards an exact algorithm
• Shortest paths on polyhedral surfaces and terrains
• The Discrete Geodesic Problem
• The weighted region problem
• Triangulation refinement and approximate shortest paths in weighted regions

Cited in

(5)

• An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
• Optimal facility location problem on polyhedral terrains using descending paths
• Navigating Weighted Regions with Scattered Skinny Tetrahedra
• An approximation algorithm for computing shortest paths in weighted 3-d domains
• An \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures

This page was built for publication: Navigating weighted regions with scattered skinny tetrahedra

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