Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...

Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...

Locusts exhibit two interconvertible behavioral phases, solitarious and gregarious. While solitarious individuals are repelled from other locusts, gregarious insects are attracted to conspecifics and can form large aggregations such as marching hopper bands. Numerous biological experiments at the individual level have shown how crowding biases conversion towards the gregarious form. To understa...

A multi-dimensional algorithm for surface extraction from a structured domain is presented. Topological information is used to split the n-cubes into simplices which are used to extract the possible configurations of new surface elements. The algorithm is intended to complement to the existing surface extraction algorithms, which are specialized to deal with a set dimension, while this algorith...

An evaluation of two traditional segmentation algorithms of Morphological Reconstruction and the Fast Marching method along with a novel hybrid segmentation approach is presented. After introducing the Fast Marching and the Morphological Reconstruction segmentation, we propose a novel hybrid segmentation approach in multi-stage, which is derived from both an improved Fast Marching method and th...

The marching cubes [7,15] method demonstrated that isosurface extraction can be reduced, using a divide-and-conquer approach, to solving a local triangulation problem. In addition, the marching cubes method proposed a simple and efficient local triangulation using a lookup table. However, the marching cubes did not address the divide portion of the approach, i.e., how to efficiently search a la...

An adaptive method for polygonization of implicit surfaces is presented. The method insists on the shape of triangles and the accuracy of resulting approximation as well. The presented algorithm is based on the surface tracking scheme and it is compared with the other algorithms based on the similar principle, such as the Marching cubes and the Marching triangles methods. The main advantages of...

ABSTRACT: An approximate approach for the frequencyand time-domain aeroelastic analysis of bridge decks is presented. The aerodynamic transfer functions are approximated as a linear function with the coefficients determined through minimization of the weighted error between the exact and approximated transfer function. The weighting function in optimization is introduced for the improved approx...

Based on the recently developed local radial basis function method, we devise an implicit local radial basis function scheme, which is intrinsic mesh-free, for solving time fractional diffusion equations. In this paper the L1 scheme and the local radial basis function method are applied for temporal and spatial discretization, respectively, in which the time-marching iteration is performed impl...