This work is motivated by the need to pass information eeciently among subdomains when solving partial diierential equations with a domain decomposition approach. Because of ever greater demands for exibility, no restrictive assumptions are made about the grids used to discretize the subdomains. Indeed, the union of all grid eld points is treated as a general collection of points from which inf...

A co-volume scheme is introduced for the rotating shallow water equations, in which both velocity components are specified on cell edges, and the thickness variables evolve on both the primary and the dual cell centers. The scheme applies to generic, conforming and non-orthogonal staggered grids, including the widely used lat-lon quadrilateral grids and the Delaunay-Voronoi tessellations. It ca...

This paper describes a technique for finding regular grids in the images of calibration patterns, a crucial step in calibrating cameras. Corner features located by a corner detector are connected using Delaunay triangulation. Pairs of neighboring triangles are combined into quadrilaterals, which are then topologically filtered and ordered. We introduce a unique data structure for representing b...

An algorithm for constructing almost regular triangulations (ARTs) for three-dimensional polygonal domains is described. Ideally such triangulations consist entirely of congruent tetrahedra with nearly equal edges. The new feature of this method is that the position of the vertices is adjusted, before any connecting edges are assigned. This leads to grids with very few irregular vertices, i.e. ...

This paper introduces a fast and efficient algorithm for surface reconstruction. As many algorithms of this kind, it produces a piecewise linear approximation of a surface S from a finite, sufficiently dense, subset of its points. Originally, the starting point of this work does not come from the computational geometry field. It is inspired by an existing numerical scheme of surface convection ...

We describe the implementation of an incremental insertion algorithm to construct and maintain three-dimensional Delaunay triangulations with dynamic vertices using a three-simplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tesselation. A given list of generators is triangulated and volumes as well as contact surfaces of the Dirichlet region...

Phase unwrapping is a key issue for PSP (Permanent Scatters Pairs) time series analysis. In this paper, the LLL method and grid search method are applied for determining elevation error and velocity difference in LOS for each PSP, and the RMS is used to assess the correctness of the solution. The Delaunay triangulation is used to formulate PSPs, which are used to unwrap elevations and velocitie...

We describe a technique to generate structurally aligned triangular grids. The main advantage of this method is the adjustable propagating speed of the front in different parts of the simulation domain in order to achieve different densities of triangles in each part of the simulation domain. This feature is usually needed in semiconductor device simulation. Other advantages of this technique a...