1992IEEE Transactions on MagneticsRequires access

Automatic generation of 3D meshes for complicated solids

Jinyu Zhou, Kun Zhou, K.R. Shao

Open publisher page 6 citations

Abstract

To approach full automatic mesh generation, three problems have to be solved: (1) full automatic generation of geometry specifying the mesh from the solid model; (2) a constrained triangulation algorithm for adding a new point to an existing mesh; and (3) a description and realization of the user's mesh distribution desires which may be implied by the problem itself, as in the case of self-adaptive finite element analysis. The authors merge a novel mesh control idea (see J.M. Zhou, 1989) with the constrained Delaunay triangulation algorithm and an initial triangulation algorithm to achieve efficient, flexible, and reliable triangulation of complicated solids. A new strategy for adaptive mesh refinement is also included.>

About this research paper

What this paper is about

To approach full automatic mesh generation, three problems have to be solved: (1) full automatic generation of geometry specifying the mesh from the solid model; (2) a constrained triangulation algorithm for adding a new point to an existing mesh; and (3) a description and realization of the user's mesh distribution desires which may be implied by the problem itself, as in the case of self-adaptive finite element analysis. The authors merge a novel mesh control idea (see J.M. Zhou, 1989) with the constrained Delaunay triangulation algorithm and an initial triangulation algorithm to achieve efficient, flexible, and reliable triangulation of complicated solids. A new strategy for adaptive mesh refinement is also included.>

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

To approach full automatic mesh generation, three problems have to be solved: (1) full automatic generation of geometry specifying the mesh from the solid model; (2) a constrained triangulation algorithm for adding a new point to an existing mesh; and (3) a description and realization of the user's mesh distribution desires which may be implied by the problem itself, as in the case of self-adaptive finite element analysis. The authors merge a novel mesh control idea (see J.M. Zhou, 1989) with the constrained Delaunay triangulation algorithm and an initial triangulation algorithm to achieve efficient, flexible, and reliable triangulation of complicated solids. A new strategy for adaptive mesh refinement is also included.>

Key concepts: Delaunay triangulation, Mesh generation, Computer science, Polygon mesh, Triangulation, Constrained Delaunay triangulation, Bowyer–Watson algorithm, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Automatic generation of 3D meshes for complicated solids — Research Paper | ScholarLens