This paper presents a method for optimum placement of nodes in grid generation for process simulation together with an algorithm for updating the grid after each addition of a new node to ensure that the Delaunay property is satisfied. Placement of nodes is decided on by considering the optimum error in evaluating the integral sv C(z)dz. The best error estimate is obtained when the node coincid...

Two-dimensional Euler equations have been solved on an unstructured grid. An upwind finite volume scheme, based on Roe's flux difference splitting method, is used to discretize the equations. Using advancing front method, an initial Delaunay triangulation has been made. The adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, ac...

two-dimensional euler equations have been solved on an unstructured grid. an upwind finite volume scheme, based on roes flux difference splitting method, is used to discretize the equations. using advancing front method, an initial delaunay triangulation has been made. the adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, acc...

Two-dimensional Euler equations have been solved on an unstructured grid. An upwind finite volume scheme, based on Roes flux difference splitting method, is used to discretize the equations. Using advancing front method, an initial Delaunay triangulation has been made. The adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, acc...

Unstructured mesh techniques take an important place in grid generation. The main feature of unstructured grids consists, in contrast to structured grids, in a nearly absolute absence of any restrictions on grid cells, grid organization, or grid structure. It allows placing the grid nodes locally irrespective of any coordinate direction, so that complex geometries with curved boundaries can be ...

We present the theory and implementation for a new automatic adaptive h-re nement and -dere nement method for twoand three-dimensional elliptic problems. An exact lower error bound for dere nement is obtained theoretically in terms of the nite element solution, complementing the various known upper error bounds for re nement. These error bounds are used to determine where to insert and/or remov...

We present the theory and implementation for a new automatic adaptive h re nement and dere nement method for two and three dimensional elliptic problems An exact lower error bound for dere nement is obtained theoretically in terms of the nite element solution complementing the various known upper error bounds for re nement These error bounds are used to determine where to insert and or remove m...

An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...

We propose an algorithm which constructs an interpolating triangular mesh from a closed point cloud of arbitrary genus. The algorithm first constructs an intermediate structure called a Delaunay cover, which forms a barrier between the inside and the outside of the object. This structure is used to build a boolean voxel grid, with cells intersecting the cover colored black and all other cells c...

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...