Fast algorithm for the visualization of surfaces

In several engineering applications such as mechanism design or control theory, it is important to visualize the solution surface of an implicit equation of the form f(x, y, z) = 0. The first efficient algorithm to visualize such surface was the marching cube [5], and was enhanced more recently with variants such as surface nets [1, 3] and dual contouring [4]. These algorithms are based on the evaluation of the function f on a regular grid of points in R3.