Navigating weighted regions with scattered skinny tetrahedra
From MaRDI portal
Publication:5370569
DOI10.1142/S0218195917600020zbMATH Open1372.68257OpenAlexW2754203313MaRDI QIDQ5370569FDOQ5370569
Jiongxin Jin, Siu-Wing Cheng, Man-Kwun Chiu, 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
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Title not available (Why is that?)
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- New results on shortest paths in three dimensions
- Title not available (Why is that?)
- The Discrete Geodesic Problem
- The weighted region problem
- Approximate Shortest Paths in Anisotropic Regions
- On finding approximate optimal paths in weighted regions
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Approximating shortest paths on weighted polyhedral surfaces
- Determining approximate shortest paths on weighted polyhedral surfaces
- Shortest descending paths through given faces
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Shortest descending paths: towards an exact algorithm
- Approximation algorithms for shortest descending paths in terrains
- An algorithm for shortest-path motion in three dimensions
- Shortest paths on polyhedral surfaces and terrains
- Approximate Shortest Descending Paths
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Geophysical data analysis: Discrete inverse theory. MATLAB edition.
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Querying Approximate Shortest Paths in Anisotropic Regions
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Triangulation Refinement and Approximate Shortest Paths in Weighted Regions
Cited In (2)
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)
