ISSN:
1435-5663
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
,
Technology
Notes:
Abstract This paper describes a method for generating tetrahedral meshes. The algorithm, based on the Delaunay triangulation, can treat objects of essentially arbitrary complexity. In order to preserve the surface triangulation of solid objects, it is necessary to override the Delaunay property and redefine the triangulation when points are introduced that are close to solid boundaries. Details of this constrained Delaunay algorithm are presented and an efficient implementation of the triangulation method is described. Techniques for controlling the distribution of mesh points and tetrahedron quality are also discussed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02274210
Permalink