Pages that link to "Item:Q5940611"
From MaRDI portal
The following pages link to Approximating shortest paths on weighted polyhedral surfaces (Q5940611):
Displaying 18 items.
- Fast query structures in anisotropic media (Q391227) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- On discretization methods for approximating optimal paths in regions with direction-dependent costs (Q1045920) (← links)
- Path refinement in weighted regions (Q1799222) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- Discrete Lagrangian algorithm for finding geodesics on triangular meshes (Q1985213) (← links)
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- An Experimental Study of Weighted k-Link Shortest Path Algorithms (Q3564306) (← links)
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS (Q3628100) (← links)
- Density-Based Clustering Based on Topological Properties of the Data Set (Q3628367) (← links)
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications (Q3628368) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
- Robust radial basis function interpolation based on geodesic distance for the numerical coupling of multiphysics problems (Q6660354) (← links)
