scispace - formally typeset
Proceedings ArticleDOI

Guaranteed-quality mesh generation for curved surfaces

L. Paul Chew
- pp 274-280
TLDR
This paper presents a technique for creating high-quality triangular meshes for regions on curved surfaces, an extension of previous methods developed for regions in the plane.
Abstract
For several commonly-used solution techniques for partial differential equations, the first step is to divide the problem region into simply-shaped elements, creating a mesh. We present a technique for creating high-quality triangular meshes for regions on curved surfaces. This technique is an extension of previous methods we developed for regions in the plane. For both flat and curved surfaces, the resulting meshes are guaranteed to exhibit the following properties: (1) internal and external boundaries are respected, (2) element shapes are guaranteed—all elements are triangles with angles between 30 and 120 degrees (with the exception of badly shaped elements that may be required by the specified boundary), and (3) element density can be controlled, producing small elements in “interesting” areas and large elements elsewhere. An additional contribution of this paper is the development of a practical generalization of Delaunay triangulation to curved surfaces.

read more

Citations
More filters
Book ChapterDOI

Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

TL;DR: Triangle as discussed by the authors is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunayer refinement algorithm for quality mesh generation, and it is shown that the problem of triangulating a planar straight line graph (PSLG) without introducing new small angles is impossible for some PSLGs.
Journal ArticleDOI

Delaunay refinement algorithms for triangular mesh generation

TL;DR: An intuitive framework for analyzing Delaunay refinement algorithms is presented that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and helps to solve the difficult problem of meshing nonmanifold domains with small angles.
Journal ArticleDOI

A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

TL;DR: Compared with previous quadtree-based algorithms for quality mesh generation, the Delaunay refinement approach is much simpler and generally produces meshes with fewer triangles.
Journal ArticleDOI

Surface Reconstruction by Voronoi Filtering

TL;DR: A simple combinatorial algorithm that computes a piecewise-linear approximation of a smooth surface from a finite set of sample points that uses Voronoi vertices to remove triangles from the Delaunay triangulation is given.
Proceedings ArticleDOI

Tetrahedral mesh generation by Delaunay refinement

TL;DR: Given a complex of vertices, constraining segments, and planar straight-line constraining facets in E3, an algorithm presented herein can generate a conforming mesh of Delaunay tetrahedra whose circumradius-to-shortest edge ratios are no greater than two.
References
More filters
Journal ArticleDOI

Provably good mesh generation

TL;DR: It is shown how to triangulate a planar point set or a polygonally bounded domain with triangles of bounded aspect ratio, and how to produce a linear-size Delaunay triangulation of a multidimensional point set by adding a linear number of extra points.
Proceedings ArticleDOI

A new and simple algorithm for quality 2-dimensional mesh generation

TL;DR: A simple new algorithm for triangulating polygons and planar straightline graphs that provides "shape" and "size" guarantees and extends a mesh generation technique of Chew by allowing triangles that vary in size.
Proceedings ArticleDOI

Quality mesh generation in three dimensions

TL;DR: This work shows how to triangulate a three dimensional polyhedral region with holes, which achieves the best possible aspect ratio up to a constant and is desired as an initial mesh for a finite element mesh refinement algorithm.