In this paper, a sequential 2D unstructured grid generator based on iterative point insertion and local reconnection is coupled with a Delauney tessellation domain decomposition scheme to create a scalable parallel unstructured grid generator. The Message Passing Interface (MPI) is used for distributed communication in the parallel grid generator. This work attempts to provide a generic framewo...

We describe the implementation of algorithms to construct and maintain threedimensional dynamic Delaunay triangulations with kinetic vertices using a threesimplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tessellation. Initially, a given list of points is triangulated. Time evolution of the triangulation is not only governed by kinetic vert...

An algorithm for the generation of non-uniform unstructured grids on ellipsoidal geometries is described. This technique is designed to generate high quality triangular and polygonal meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric and ocean simulation, and numerical weather predication. Using a recently developed Frontal-Delaunay-refinem...

The past decade has known an increasing interest in the solution of the Euler equations on unstructured grids due to the simplicity with which an unstructured grid can be tailored around very complex geometries and be adapted to the solution. It is desirable that the mesh can be generated with minimum input from the user, ideally, just specifying the boundary geometry and, perhaps, a function t...

Delaunay triangulation is always used to construct TIN, and is also widely applied in manifold fields, for it can avoid long and skinny triangles resulting in a nice looking map. A wide variety of algorithms have been proposed to construct delaunay triangulation, such as divide-and-conquer, incremental insertion, trangulation growth, and so on. The compound algorithm is also researched to const...

This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to voxel based approaches by taking advantage of surface based approaches. To this aim, we introduce a space discretization which does not rely on a regular grid, where most cells are ineffective, but rather on an irregular ...

A new approach to triangular mesh generation based on the molecular dynamics method is proposed. Mesh nodes are considered as interacting particles. After the node placement by molecular dynamics simulation, well-shaped triangles or tetrahedra can be created after connecting the nodes by Delaunay triangulation or tetrahedrization. Some examples are considered in order to illustrate themethod’s ...

We propose an unstructured mesh redistribution method without using skewed elements for steady-state problems. The regions around solution features are indicated by a sensor function. The medial axes of the strong feature regions are calculated so that elements can be clustered around the most important solution features efficiently. Two approaches, a discrete surface-based approach using a Del...

Abstract. We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first locate a point close to the query point. For points uniformly distributed on the unit square, we show that the expected point location complexities are Θ( √ n) for the Green-Sibson rectilinear search, Θ(n) for...

The properties of C-grid staggered spatial discretizations of the shallow-water equations on regular Delaunay triangulations on the sphere are analyzed. Mass-conserving schemes that also conserve either energy or potential enstrophy are derived, and their features are analogous to those of the C-grid staggered schemes on quadrilateral grids. Results of numerical tests carried out with explicit ...