We develop a new approach to vector quantization, which guarantees an intrinsic stationarity property that also holds, in contrast to regular quantization, for non-optimal quantization grids. This goal is achieved by replacing the usual nearest neighbor projection operator for Voronoi quantization by a random splitting operator, which maps the random source to the vertices of a triangle of d-si...

We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...

We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...

A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay triangulation of a polygonal domain. The algorithm simplifies the complicated merging step inherent to divide-and-conquer algorithms for the computation of triangulations. Furthermore, no triangles are computed outside the valid region of the domain. A grid structure accelerat...

An algorithm for the generation of non-uniform, locally orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered Voronoi–Delaunay meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric simulation, ocean-modelling and numerical weather prediction. Using a recently develop...

Fast Relabeling of Deformable Delaunay Tetrahedral Meshes Using a Compact Uniform Grid David C. Frogley Department of Computer Science, BYU Master of Science We address the problem of fast relabeling of deformable Delaunay tetrahedral meshes using a compact uniform grid, with CPU parallelization through OpenMP. This problem is important in visualizing the simulation of deformable objects and ar...

In this paper, an adaptive split-and-merge segmen-tation method is proposed. The splitting phase of the algorithm employs the in-cremental Delaunay triangulation competent of forming grid edges of arbitrary orientation and position. The tessellation grid, deened by the Delaunay trian-gulation, is adjusted to the semantics of the image data by combining similarity and diierence information among...

ÐAn adaptive image segmentation scheme is proposed employing the Delaunay triangulation for image splitting. The tessellation grid of the Delaunay triangulation is adapted to the semantics of the image data by combining region and edge information. To achieve robustness against imaging conditions (e.g., shading, shadows, illumination, and highlights), photometric invariant similarity measures, ...