Tetrahedra are used extensively in unstructured grid computations. When using an octal tree organization of tetrahedra the term "unstructured" is actually inapropriate; there exists extensive regularity in the grid construction that enables the computational overhead to be comparable to that of Cartesian grids. I am interested in exploting this regularity to construct efficient adaptive mesh algorithms.
[Home] [Research] [Publications] [Software] [Course Webs]