Visualization of Three-Dimensional Delaunay Meshes

Abstract.

We describe an algorithm for the rapid display of three-dimensional Delaunay meshes (or selected portions thereof) on standard raster displays, without the use of special purpose graphics hardware. The algorithm allows the display of the interior structure as well as the surface of the mesh, and furthermore does not require that the meshed domain be convex, or even connected.

The algorithm computes a depth ordering on the mesh elements. This ordering can be used to display subsets of the mesh, as well as isosurfaces induced by fields represented on the mesh. Furthermore, by utilizing mesh coherence, the depth ordering can be used to view the mesh from front to back as well as back to front.

An implementation of the algorithm has been incorporated in a system for designing and analyzing the performance of three-dimensional semiconductor and electronic packaging structures. The system is in regular use and the mesh-display algorithm has been used to visualize both meshes and fields computed over the meshes.