▪ Abstract An overview of the current state of the art in unstructured mesh techniques for
computational fluid dynamics is given. The topics of mesh generation and adaptation, spatial …

Triangulations presents the first comprehensive treatment of the theory of secondary
polytopes and related topics. The text discusses the geometric structure behind the …

The topic of this chapter, Voronoi diagrams, differs from other areas of computational
geometry, in that its origin dates back to the 17th century. In his book on the principles of …

When a mesh of simplicial elements (triangles or tetrahedra) is used to form a piecewise
linear approximation of a function, the accuracy of the approximation depends on the sizes …

We present a simple, effective, and efficient technique for approximating arbitrary polyhedra.
It is based on triangulation and vertex-clustering, and produces a series of 3D …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We survey the computational geometry relevant to finite element mesh generation. We
especially focus on optimal triangulations of geometric domains in two-and three …

One of the major achievements in engineering science has been the development of
computer algorithms for solving nonlinear differential equations such as the Navier-Stokes …

We study several versions of the problem of generating triangular meshes for finite element
methods. We show how to triangulate a planar point set or polygonally bounded domain …

A mesh is a discretization of a geometric domain into small simple shapes, such as triangles
or quadrilaterals in two dimensions and tetrahedra or hexahedra in three. Meshes find use …