DocumentCode
1397647
Title
Boundary refinement in n-dimensional Delaunay-meshing
Author
Gyimóthy, Szabolcs ; Vagvolgyi, A. ; Sebestyén, Imre
Author_Institution
Dept. of Electromagnetic Theory, Tech. Univ. Budapest, Hungary
Volume
36
Issue
4
fYear
2000
fDate
7/1/2000 12:00:00 AM
Firstpage
1569
Lastpage
1573
Abstract
A practical and robust mesh refinement algorithm was developed for simplex meshes based on the point insertion method. The algorithm fully exploits the n-dimensional phenomenon of simplex elements, and focuses on boundary refinement as the most general case. The resulting mesh is a constrained Delaunay-type. The algorithm was successfully tested on 3D and 4D problems. Also a data structure was developed for the efficient implementation of the algorithm
Keywords
boundary-elements methods; mesh generation; 3D problems; 4D problems; boundary refinement; data structure; n-dimensional Delaunay-meshing; point insertion method; simplex meshes; Finite element methods; Geometry; Joining processes; Kernel; Mesh generation; Multidimensional systems; Roundoff errors; Terminology;
fLanguage
English
Journal_Title
Magnetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9464
Type
jour
DOI
10.1109/20.877739
Filename
877739
Link To Document