Pages that link to "Item:Q603866"
From MaRDI portal
The following pages link to Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866):
Displaying 10 items.
- Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\) (Q390105) (← links)
- Fast query structures in anisotropic media (Q391227) (← links)
- Line facility location in weighted regions (Q543511) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Subdivision surface fitting to a dense mesh using ridges and umbilics (Q1632302) (← links)
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures (Q2144452) (← links)
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case (Q2248735) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- Similarity of polygonal curves in the presence of outliers (Q2444314) (← links)
- Path planning in a weighted planar subdivision under the Manhattan metric (Q6184991) (← links)
