Table 3. The information of benchmark unstructured grid datasets. Each column shows the number of vertex, tetrahedra, face, and boundary faces, and the required memory size for storing triangle lists by two algorithms.

	The number of primitives				Required memory for triangle list(s)
	Vertex	Tetra	Face	Boundary face	VTK (GB)	Ours (GB)
Dataset 1	647,073	3,773,943	7,583,488	71,614	0.41	0.82
Dataset 2	7,320,994	41,257,368	83,385,432	1,741,392	4.41	9.01
Dataset 3	7,659,517	41,939,085	85,051,683	2,347,026	4.47	9.19