Metaballs

1: The influence of 2 positive metaballs on each other.
2: The influence of a negative metaball on a positive metaball by creating an indentation in the positive metaball's surface.

Metaballs are, in computer graphics, organic-looking n-dimensional objects. The technique for rendering metaballs was invented by Jim Blinn in the early 1980s.

Each metaball is defined as a function in n-dimensions (i.e. for three dimensions, $f(x,y,z)$; three-dimensional metaballs tend to be most common, with two-dimensional implementations popular as well). A thresholding value is also chosen, to define a solid volume. Then,

$\sum _{{i=0}}^{n}{\mbox{metaball}}_{i}(x,y,z)\leq {\mbox{threshold}}$

represents whether the volume enclosed by the surface defined by $n$ metaballs is filled at $(x,y,z)$ or not.

A typical function chosen for metaballs is $f(x,y,z)=1/((x-x_{0})^{2}+(y-y_{0})^{2}+(z-z_{0})^{2})$, where $(x_{0},y_{0},z_{0})$ is the center of the metaball. However, due to the divide, it is computationally expensive. For this reason, approximate polynomial functions are typically used.

When seeking a more efficient falloff function, several qualities are desired:

• Finite support. A function with finite support goes to zero at a maximum radius. When evaluating the metaball field, any points beyond their maximum radius from the sample point can be ignored. A hierarchical culling system can thus ensure only the closest metaballs will need to be evaluated regardless of the total number in the field.
• Smoothness. Because the isosurface is the result of adding the fields together, its smoothness is dependent on the smoothness of the falloff curves.

The simplest falloff curve that satisfies these criteria is: $f(r)=(1-r^{2})^{2}$, where r is the distance to the point. This formulation avoids expensive square root calls.

More complicated models use a Gaussian potential constrained to a finite radius or a mixture of polynomials to achieve smoothness. The Soft Object model by the Wyvill brothers provides higher degree of smoothness and still avoids square roots.

A simple generalization of metaballs is to apply the falloff curve to distance-from-lines or distance-from-surfaces.

There are a number of ways to render the metaballs to the screen. In the case of three dimensional metaballs, the two most common are brute force raycasting and the marching cubes algorithm.

2D metaballs were a very common demo effect in the 1990s. The effect is also available as an XScreensaver module.

Further reading

• Blinn, J. F. (July 1982). "A Generalization of Algebraic Surface Drawing". ACM Transactions on Graphics. 1 (3): 235–256. doi:10.1145/357306.357310.

External links

• Implicit Surfaces article by Paul Bourke
• Meta Objects article from Blender wiki
• Metaballs article from SIGGRAPH website
• Exploring Metaballs and Isosurfaces in 2D by Stephen Whitmore (gamedev article)
• Simulating 2D Metaball Blobbies with Photoshop

References

• Intro to Metaballs