Scientific simulation is gaining attention as an inexpensive means of experimentation in scientific computing, as is the data generated by the simulation. Scientific simulation typically generates mesh data, i.e., data in a grid structure, in a sequence of time steps. The data is complex, as is the file structure. Understanding these involves analyzing the topology and geometry of grid points, ...

We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events where the Hausdorff distance may occur, is fully classified. These events include simple cases where foot points of vertices are examined as well as more complicated cases where extreme distance evaluation is needed on t...

A new approach to the numerical solution of systems of first-order ordinary differential equations is given by finding local Galerkin approximations on each subinterval of a given mesh of size h. One step at a time, a piecewise polynomial, of degree n and class C°, is constructed, which yields an approximation of order 0(A*") at the mesh points and 0(A"+1) between mesh points. In addition, the ...

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm with Cross-Entropy (CE) method for nonsmooth constrained optimization. The CE is used as an exploration step by MADS algorithm. result of this combination retains convergence properties and allows efficient in order move away from local minima. samples trial points according multivariate normal distribution wh...

Nose tip detection is an essential point in 3d face alignment, pose estimation and the discrimination process. A method to determine nose tip location based on exploiting local descriptors(shape index) from each point cloud on the 3d surface mesh is presented in this paper. Furthermore, theeffective energy constraint was appliedover each 3d mesh data point. Then NN-Nearest Neighbour classificat...

In reconstructing 3-D from images based on feature points, one usually defines a triangular mesh that has these feature points as vertices and displays the scene as a polyhedron. If the scene itself is a polyhedron, however, some of the displayed edges may be inconsistent with the true shape. This paper presents a new technique for automatically eliminating such inconsistencies by using a speci...

We develop data assimilation techniques for nonlinear dynamical systems modelled by moving mesh methods. Such techniques are valuable for explicitly tracking interfaces and boundaries in evolving systems. The unique aspect of these assimilation techniques is that both the states of the system and the positions of the mesh points are updated simultaneously using physical observations. Covariance...

In this paper, we develop an efficient moving mesh weighted essentially nonoscillatory (WENO) method for one-dimensional hyperbolic conservation laws. The method is based on the quasi-Lagrange approach of the moving mesh strategy in which the mesh is considered to move continuously in time. Several issues arising from the implementation of the scheme, including mesh smoothness, mesh movement re...

The centroidal Voronoi tessellation based Delaunay triangulation (CVDT) provides an optimal distribution of generating points with respect to a given density function and accordingly generates a high-quality mesh. In this paper, we discuss algorithms for the construction of the constrained CVDT from an initial Delaunay tetrahedral mesh of a three-dimensional domain. By establishing an appropria...

Mesh generation is a critical step in high fidelity computational simulations. High quality and high density meshes are required to accurately capture the complex physical phenomena. A parallel framework has been developed to generate large-scale meshes in a short period of time. A coarse volume mesh is generated first to provide the basis of block interfaces and partitioned into a number of su...