Simplicial pivoting for mesh generation of implicitly defined surfaces (Q1183523): Difference between revisions

The authors discuss a method of triangulation for a surface in \(\mathbb{R}^ 3\) given by an equation \(H(x_ 1,x_ 2,x_ 3)=0\). The main point is an efficient way of storing data on simplices and a time and memory saving way of reflecting simplices. The evaluation of \(H\) and its gradient at the vertices then allows an adaptive subdivision algorithm and algorithms that identify singular points and their nature. Examples are given of applications to surfaces of the form \(H(x)=min(f(x),g(x))+h(x)=0\).