Shirley and Tuchman’s projected tetrahedra approach is a fast algorithm for unstructured volume visualization, because it generates triangles that may be rendered by hardware acceleration. In this paper, I explore optimizations using OpenGL triangle fans, customized quicksort, memory organization for cache efficiency, display lists, and tetrahedral culling. The optimizations improve the perform...

Tetrahedral meshes are often used for simulating deformable objects. Unlike engineering disciplines that often focuses on accuracy, computer graphics is biased towards stable, robust, and fast methods. In that spirit we present an approach for building an adaptive inward shell of the surface of an object. The goal is to device a simple and fast algorithm capable of building a topologically cons...

A tetrahedral curve is a space curve whose defining ideal is an intersection of powers of monomial prime ideals of height two. It is supported on a tetrahedral configuration of lines. Schwartau described when certain such curves are ACM, namely he restricted to curves supported on a certain four of the six lines. We consider the general situation. We first show that starting with an arbitrary t...

A new algorithm for simulation of polymer coextrusion is introduced. In the new algorithm, the finite element mesh of tetrahedral elements remains unaltered as the interface shape between adjacent polymer layers is developed during the simulation. The use of a fixed finite element mesh for coextrusion simulation is possible because in the new algorithm the interface between the two polymers is ...