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...

This paper presents a procedure for eecient generation of three-dimensional unstructured meshes of tetrahedral elements. Initially, a constrained Delaunay mesh is generated wherein internal points are created using advancing-front point placement and are inserted using a Delaunay method. The overall procedure is applied repetitively until the mesh satisses a desired element size distribution fu...

The $\beta$-Delaunay tessellation in $\mathbb{R}^{d-1}$ is a generalization of the classical Poisson-Delaunay tessellation. As first result this paper we show that shape weighted typical cell tessellation, conditioned on having large volume, close to regular simplex $\mathbb{R}^{d-1}$. This generalizes earlier results Hug and Schneider about (non-weighted) simplex. Second, asymptotic behaviour ...

protein structural flexibility is important for catalysis, binding, protein design, and allostery. some simple methods have recently been introduced to compute protein flexibility directly from the protein structure without any mechanical models. for example the atomic mean square displacement (or b-factor) is related to the number of neighboring atoms. the protein structure can be modeled as a...

An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is shown that the use of off-centre Steiner points, positioned on the faces of the associated Voronoi diagram, typically leads to significant improvements in t...