Pages that link to "Item:Q5956035"
From MaRDI portal
The following pages link to Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces (Q5956035):
Displaying 31 items.
- Non-local discrete \(\infty \)-Poisson and Hamilton Jacobi equations. From stochastic game to generalized distances on images, meshes, and point clouds (Q283017) (← links)
- Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\) (Q390105) (← links)
- A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching (Q408814) (← links)
- Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids (Q550889) (← links)
- Computation of the signed distance function to a discrete contour on adapted triangulation (Q695622) (← links)
- Fast geodesics computation with the phase flow method (Q860276) (← links)
- An improvement of a recent Eulerian method for solving PDEs on general geometries (Q867033) (← links)
- Solving variational problems and partial differential equations mapping into general target manifolds. (Q1428663) (← links)
- Rapid and accurate computation of the distance function using grids (Q1601551) (← links)
- Efficient direct re-initialization approach of a level set method for unstructured meshes (Q1648382) (← links)
- Geodesics on point clouds (Q1719261) (← links)
- Structural analysis of an \(L\)-infinity variational problem and relations to distance functions (Q2020200) (← links)
- A spectral approach to the shortest path problem (Q2020688) (← links)
- Nonparametric Bayes subject to overidentified moment conditions (Q2116355) (← links)
- Equivalent extensions of Hamilton-Jacobi-Bellman equations on hypersurfaces (Q2199690) (← links)
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case (Q2248735) (← links)
- Geometric active contours without re-initialization for image segmentation (Q2270830) (← links)
- High-order methods for computing distances to implicitly defined surfaces (Q2347620) (← links)
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709) (← links)
- Weighted distance maps computation on parametric three-dimensional manifolds (Q2381173) (← links)
- Fourth order partial differential equations on general geometries (Q2495770) (← links)
- A variational approach to path planning in three dimensions using level set methods (Q2572792) (← links)
- A variational approach to spline curves on surfaces (Q2574276) (← links)
- O(\(N\)) implementation of the fast marching algorithm (Q2581675) (← links)
- A fast sweeping method for eikonal equations on implicit surfaces (Q2629243) (← links)
- A level set based segmentation approach for point-sampled surfaces (Q2644581) (← links)
- A global approach to the refinement of manifold data (Q2826685) (← links)
- A Level Set Based Variational Principal Flow Method for Nonparametric Dimension Reduction on Riemannian Manifolds (Q5350441) (← links)
- Parallel chen-han (PCH) algorithm for discrete geodesics (Q5419165) (← links)
- Variance-covariance from a metropolis chain on a curved, singular manifold (Q6108279) (← links)
- A simple embedding method for the Laplace-Beltrami eigenvalue problem on implicit surfaces (Q6575302) (← links)
