A framework for advancing front techniques of finite element mesh generation | Zendy

S. Farestam | Zendy; R. B. Simpson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A framework for advancing front techniques of finite element mesh generation

Author(s) -

S. Farestam,

R. B. Simpson

Publication year - 1995

Publication title -

bit numerical mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.904

H-Index - 59

eISSN - 1572-9125

pISSN - 0006-3835

DOI - 10.1007/bf01737163

Subject(s) - delaunay triangulation , correctness , constrained delaunay triangulation , computer science , finite element method , mesh generation , triangulation , bowyer–watson algorithm , boundary (topology) , domain (mathematical analysis) , algorithm , representation (politics) , ruppert's algorithm , mathematical optimization , mathematics , geometry , structural engineering , engineering , mathematical analysis , politics , law , political science

Advancing front techniques are a family of methods for finite element mesh generation that are particularly effective in dealing with complicated boundary geometries. In the first part of this paper, conditions are presented which ensure that any planar aft algorithm that meets these conditions terminates in a finite number of steps with a valid triangulation of the input domain. These conditions are described by specifying a framework of subtasks that can accommodate many aft methods and by prescribing the minimal requirements on each subtask that ensure correctness of an algorithm that conforms to the framework.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research