Navigating Weighted Regions with Scattered Skinny Tetrahedra
From MaRDI portal
Publication:5370569
DOI10.1142/S0218195917600020zbMath1372.68257OpenAlexW2754203313MaRDI QIDQ5370569
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for shortest descending paths in terrains
- Shortest descending paths through given faces
- An algorithm for shortest-path motion in three dimensions
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
- The Discrete Geodesic Problem
- Querying Approximate Shortest Paths in Anisotropic Regions
- Determining approximate shortest paths on weighted polyhedral surfaces
- Approximate Shortest Paths in Anisotropic Regions
- Constructing Approximate Shortest Path Maps in Three Dimensions
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- The weighted region problem
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Fibonacci heaps and their uses in improved network optimization algorithms
- Shortest paths on polyhedral surfaces and terrains
- New results on shortest paths in three dimensions
- Triangulation Refinement and Approximate Shortest Paths in Weighted Regions
- On finding approximate optimal paths in weighted regions
- Approximate Shortest Descending Paths
- Approximating shortest paths on weighted polyhedral surfaces
This page was built for publication: Navigating Weighted Regions with Scattered Skinny Tetrahedra
