Abstract: . A new algorithm for the generation of anisotropic, unstructured triangular meshes in two dimensions is
described. Inputs to the algorithm are the boundary geometry and a metric that specifies the desired element size and
shape as a function of position. The algorithm is an example of what we call pliant mesh generation. It first constructs
the constrained Delaunay triangulation of the domain, then iteratively smooths, refines, and retriangulates. On
each iteration, a node is selected at... (Update)
.... anisotropic mesh generation in two dimensions, for which the triangles are allowed to vary in size and shape as a function of position [2]. Additional references on the use of particles in implicit surface display and interactive surface design are given in our previous paper...
...Density of mesh points. Anisotropy of connectivity between mesh points, characterized by a d x d symmetric positive definite matrix[12]. Suppose the mesh is used to solve a PDE system defined on [2. Then most of these quantities will determine the properties of the...
Frank J. Bossen and Paul S. Heckbert. A pliant method for anisotropic mesh generation. In Proc. of 5th Intl. Meshing Roundtable, pages 63--74, 1996. http://citeseer.nj.nec.com/bossen96pliant.html More
@inproceedings{ bossen96pliant,
author = "Frank J. Bossen and Paul S. Heckbert",
title = "A Pliant Method for Anisotropic Mesh Generation",
booktitle = "5th Intl. Meshing Roundtable",
month = "Oct.",
pages = "63-74",
year = "1996",
url = "citeseer.nj.nec.com/bossen96pliant.html" }