scholarly journals A simple algorithm for adaptive refinement of tetrahedral meshes combined with edge elements

1993 ◽  
Vol 29 (2) ◽  
pp. 1898-1901 ◽  
Author(s):  
P. Olszewski ◽  
T. Nakata ◽  
N. Takahashi ◽  
K. Fujiwara
AIAA Journal ◽  
1995 ◽  
Vol 33 (5) ◽  
pp. 928-932 ◽  
Author(s):  
S. N. Muthukrishnan ◽  
P. S. Shiakolas ◽  
R. V. Nambiar ◽  
K. L. Lawrence

2005 ◽  
Vol 5 (4) ◽  
pp. 309-316 ◽  
Author(s):  
Philippe P. Pébay ◽  
David Thompson

This article presents a technique for the adaptive refinement of tetrahedral meshes. What makes this method new is that no neighbor information is required for the refined mesh to be compatible everywhere. Refinement consists of inserting new vertices at edge midpoints until some tolerance (geometric or otherwise) is met. For a tetrahedron, the six edges present 26=64 possible subdivision combinations. The challenge is to triangulate the new vertices (i.e., the original vertices plus some subset of the edge midpoints) in a way that neighboring tetrahedra always generate the same triangles on their shared boundary. A geometric solution based on edge lengths was developed previously, but did not account for geometric degeneracies (edges of equal length). This article provides a solution that works in all cases, while remaining entirely communication-free.


1994 ◽  
Vol 42 (1) ◽  
pp. 99-107 ◽  
Author(s):  
N.A. Golias ◽  
A.G. Papagiannakis ◽  
T.D. Tsiboukis

Sign in / Sign up

Export Citation Format

Share Document