By Topic

Adaptive refinement of first order tetrahedral meshes for magnetostatics using local Delaunay subdivisions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nehl, T.W. ; General Motors Res. Lab., Warren, MI, USA ; Field, D.A.

A mesh refinement algorithm for arbitrary tetrahedral meshes has been developed. The algorithm is suitable for use in a variety of adaptive mesh refinement schemes and has the following features: (1) it can be applied to both optimal (Delaunay) and nonoptimal meshes, (2) new nodes are inserted using a perturbed edge bisection to prevent crossing edges, and (3) the Delaunay criterion is applied locally over each tetrahedron selected for refinement. The advantage of the local Delaunay subdivision is that it decouples the subdivision process, which reduces computation time. The method has been successfully applied to several magnetostatic problems modeled using first-order tetrahedra, and has produced refined meshes of over 215000 elements.

Published in:

Magnetics, IEEE Transactions on  (Volume:27 ,  Issue: 5 )