G Peyré, M Péchaud, R Keriven… - … and Trends® in …, 2010 - nowpublishers.com
This monograph reviews both the theory and practice of the numerical computation of geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows …
Artificial intelligence has undergone immense growth and maturation in recent years, though autonomous systems have traditionally struggled when fielded in diverse and previously …
The original fast sweeping method, which is an efficient iterative method for stationary Hamilton–Jacobi equations, relies on natural ordering provided by a rectangular mesh. We …
In this paper we propose a novel computational technique to solve the Eikonal equation efficiently on parallel architectures. The proposed method manages the list of active nodes …
J Qian, YT Zhang, HK Zhao - Journal of Scientific Computing, 2007 - users.math.msu.edu
We develop a fast sweeping method for static Hamilton–Jacobi equations with convex Hamiltonians. Local solvers and fast sweeping strategies apply to structured and …
We present an efficient and scalable pipeline for fabricating full-colored objects with spatially- varying translucency from practical and accessible input data via multi-material 3D printing …
M Detrixhe, F Gibou, C Min - Journal of Computational Physics, 2013 - Elsevier
We present an algorithm for solving in parallel the Eikonal equation. The efficiency of our approach is rooted in the ordering and distribution of the grid points on the available …
We present scalable algorithms for the level-set method on dynamic, adaptive Quadtree and Octree Cartesian grids. The algorithms are fully parallelized and implemented using the MPI …