Results 281 to 290 of about 75,945 (317)
Some of the next articles are maybe not open access.
A Generalized Fast Marching Method on Unstructured Triangular Meshes
SIAM Journal on Numerical Analysis, 2013In this paper we extend the generalized fast marching method (GFMM) presented in [E. Carlini et al., SIAM J. Numer. Anal., 46 (2008), pp. 2920--2952] to unstructured meshes. The GFMM generalizes the classical fast marching method, in the sense that it can be applied to propagate interfaces with time-dependent and changing sign velocity.
CARLINI, Elisabetta +2 more
openaire +4 more sources
Some Improvements of the Fast Marching Method
SIAM Journal on Scientific Computing, 2001The fast marching method published by Sethian [Proc. Natl. Acad. Sci. USA, 93 (1996), pp. 1591--1595] is an optimally efficient algorithm for solving problems of front evolution where the front speed is monotonic. It has been used in a wide variety of applications such as robotic path planning [R. Kimmel and J.
openaire +2 more sources
A Massive Parallel Fast Marching Method
2016In this paper we present a novel technique based on domain decomposition which enables us to perform the fast marching method (FMM) [4] on massive parallel high performance computers (HPC) for given triangulated geometries. The FMM is a widely used numerical method and one of the fastest serial state-of-the-art techniques for computing the solution to ...
Roberto Croce +4 more
openaire +2 more sources
Optimal control using the Fast Marching Method
2009 35th Annual Conference of IEEE Industrial Electronics, 2009This paper presents the applications of the Fast Marching and the Buffered Fast Marching Methods to solve typical control problems. Calculus of Variations and Optimal Control problems can be solved using the Euler-Lagrange or the Pontryagin equations and solving analytically or numerically the corresponding differential equations systems.
Luis Moreno +3 more
openaire +2 more sources
Robust skeletonization using the fast marching method
IEEE International Conference on Image Processing 2005, 2005We have recently developed a level set based-framework for computing medial curves or curve skeletons CS for arbitrary 2D shapes as well as tubular and articulated 3D objects. The proposed framework is robust, fully automatic, computationally efficient, and produces curve skeletons that are connected, centered, thin, and less sensitive to boundary ...
Aly A. Farag, M.S. Hassouna
openaire +2 more sources
2004
The fast marching method was introduced by Sethian [190, 191, 192] as a computationally efficient solution to eikonal equations on flat domains. A related method was presented by Tsitsiklis in [205]. The fast marching method was extended to triangulated surfaces by Kimmel and Sethian in [112].
openaire +2 more sources
The fast marching method was introduced by Sethian [190, 191, 192] as a computationally efficient solution to eikonal equations on flat domains. A related method was presented by Tsitsiklis in [205]. The fast marching method was extended to triangulated surfaces by Kimmel and Sethian in [112].
openaire +2 more sources
Novel permeability upscaling method using Fast Marching Method
Fuel, 2014Abstract Despite computational advances, geo-cellular models are routinely upscaled for reservoir simulation purposes. Geo-cellular models typically incorporate small scale variations obtained from static data; whereas, simulation models capture dynamic data obtained from production of the field.
Mohan Kelkar, Mohammad Sharifi
openaire +2 more sources
An adaptive domain-decomposition technique for parallelization of the fast marching method
Applied Mathematics and Computation, 2011Abstract The fast marching method (FMM) is an efficient technique to solve numerically the Eikonal equation. The parallelization of the FMM is not easy because of its intrinsic sequential nature. In this paper we propose a novel approach to parallelize the FMM. It leads to an equation-dependent domain decomposition and it turns out to be particularly
Breuss +6 more
openaire +4 more sources
On the use of fast marching methods for transcranial beam focusing
The Journal of the Acoustical Society of America, 2014In this talk, we will present our recent studies on the use of fast marching methods for transcranial beam focusing. Three topics will be included: beam focusing for transcranial B-mode imaging, beam focusing for transcranial photoacoustic tomography, and beam focusing of a spherical array for therapy. To correct for the phase aberration from the skull,
Tianren Wang, Yun Jing
openaire +2 more sources
Three Dimensional Traveltimes Using the Fast Marching Method
60th EAGE Conference and Exhibition, 1998A fast, accurate and unconditionally stable 3-D traveltime algorithm is an important tool in seismic imaging. Applications of a robust traveltime computation module are not limited to 3-D Kirchhoff prestack and poststack migration, but also can be used for 3-D velocity analysis, 3-D Kirchoff modeling, 3-D Kirchhoff datuming, and 3-D variable velocity ...
J. Sethian, M. Popovici
openaire +2 more sources