Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

No Title


Adaptive meshing for moving boundary problems

Herbert Edelsbrunner at UIUC, Duke and Raindrop

Moving boundaries are characteristic for a number of physical simulation problems ... including tracking of the fluid-to-solid interface in an iron casting process. We discuss the adaptation of a triangle mesh to the moving boundary. The geometric location of the vertices adapt to the changing shape, the local density of the mesh (edge length and triangle size) adapts to the loacl curvature, and the local connectivity adapts to the chaning topology of the boundary. Combinatorially, the boundary is modeled as the envelope of certain infinite families of spheres. The main part of the talk discusses the adaptation of local mesh density to local curvature.



Theoretical Computer Science Back