This code is a replacement for previous versions of Triangulate3D (IRIS Explorer release 3.0 and previous). It shares an engine with Triangulate2D, and it now produces a correct triangulation of regular data.
The engine is an incremental point-insertion algorithm. This is ideally O(n log n) but may be up to O(n2) depending on the distribution of points.
The effect of the jitter widget has been removed as it is no longer necessary.
Port: Input Data
The input lattice of curvilinear points to be triangulated.
Type: Radio Box
Menu Item: Actual data
Menu Item: Add jitter to data
This widget does nothing but is retained for compatibility with previous releases.
Port: Output Pyramid
Constraints: 3-D compression
Constraints: unique-compression type
The resultant pyramid of tetrahedras.