The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical computer vision, fluid simulation, etc. Many alternatives have been proposed with two main objectives: to reduce its computational time and to improve its accuracy....

The purpose of this work is to define a new algorithm for converting a CSG representation into a B-Rep representation. Usually this conversion is done determining the union, intersection or difference from two B-Rep represented solids. Due to the lack of explicit representation of surface boundaries, CSG models must be converted into B-Rep solid models when a description based on polygonal mesh...

The aim of this paper is to give a detailed effect of several parameters such as step height, Reynolds number, contraction ratio, and temperature difference between the entrance and solid boundaries, of a forward-facing step. An accurate length of separation and reattachment zones are achieved. A finite-volume method (FVM) has been developed to study incompressible flow in a forward-facing step...

In this study, a novel space-time (ST) marching method is presented to solve linear and nonlinear transient flow problems in porous media. The divides the ST domain into subdomains along time axis. solutions are approximated using polyharmonic radial polynomial basis functions (RPBFs) computational domain. order proceed axis, we use numerical solution at current timespan of two as initial condi...

We present an approximation method to compute geodesic distances on triangulated domains in the three dimensional space. Our particular approach is based on the Fast Marching Method for solving the Eikonal equation on triangular meshes. As such, the algorithm is a wavefront propagation method, a reminiscent of the Dijkstra algorithm which runs in O(n log n) steps.

In this paper, an interactive segmentation method that combines fast marching and fast level set method is proposed. Level set segmentation involves solving the energybased active contour minimization problems by the computation of geodesics or minimal distance curves. First, by selecting the seed point, the fast marching method is used to extract rough boundaries of the interested object. We m...

Three-dimensional (3D) volume data has become increasingly common with the emergence and wide availability of modern 3D image acquisition techniques. The demand for computerized analysis and visualization techniques is constantly growing to utilize the abundant information embedded in these data. This thesis consists of three parts. The first part presents methods of analyzing 3D volume data by...

We apply the Space-Time Conservation Element and Solution Element (CESE) method to solve the ideal MHD equations with special emphasis on satisfying the divergence free constraint of magnetic field, i.e., ∇⋅B = 0. In the setting of the CESE method, four approaches are employed: (i) the original CESE method without any additional treatment, (ii) a simple corrector procedure to update the spatial...

The discrete ordinates method (DOM) and finitevolume method (FVM) are used extensively to solve the radiative transfer equation (RTE) in furnaces and combusting mixtures due to their balance between numerical efficiency and accuracy. These methods are typically solved using space-marching techniques since they converge rapidly for constant coefficient spatial discretization schemes and non-scat...