Chang Yu*, Yi Xu*, Ye Kuang, Yuanming Hu, Tiantian Liu (* indicates equal contribution)
The MeshTaichi framework is now officially part of Taichi and can be installed by pip. This repo only contains examples.
Meshes are an indispensable representation in many graphics applications because they provide conformal spatial discretizations. However, mesh-based operations are often slow due to unstructured memory access patterns. We propose MeshTaichi, a novel mesh compiler that provides an intuitive programming model for efficient mesh-based operations. Our programming model hides the complex indexing system from users and allows users to write mesh-based operations using reference-style neighborhood queries. Our compiler achieves its high performance by exploiting data locality. We partition input meshes and prepare the wanted relations by inspecting users’ code during compile time. During run time, we further utilize on-chip memory (shared memory on GPU and L1 cache on CPU) to access the wanted attributes of mesh elements efficiently. Our compiler decouples low-level optimization options with computations, so that users can explore different localized data attributes and different memory orderings without changing their computation code. As a result, users can write concise code using our programming model to generate efficient mesh-based computations on both CPU and GPU backends.
Install the latest Taichi and meshtaichi extension by:
python3 -m pip install -U taichi meshtaichi_patcherWe demonstrate the usage of MeshTaichi using an explicit finite element method example with the Neo-Hookean model following the course note [Sifakis and Barbic 2012]. The First Piola-Kirchhoff stress tensor is given as:
(Eq.1)
where 𝐹 describes the deformation gradient, 𝐽 is the determinant of 𝐹 , and 𝜇 and 𝜆 are the Lamé coefficients.
We need to define mesh data structures before applying them to computations. We provide the following APIs to create our new mesh instance:
import taichi as ti
import meshtaichi_patcher as Patcher
# load model file 'bunny.mesh' as tetrahedron mesh and initialize Cell-Vertex relation.
mesh = Patcher.load_mesh("bunny.mesh", relations=["CV"])Users can instantiate a mesh with an external file. Our compiler can instantiate triangle meshes using surface representation formats like “.obj” and “.ply” files, or volumetric representation formats like “.mesh” file.
Parameter relations is a list of relations, e.g ['FV', 'VV'] means initializing Face-Vert and Vertex-Vertex relations, where 'V' for Vertex, 'E' for Edge, 'F' for Face, and 'C' for Cell.
The next step is to define the attributes for each mesh element. The type of a mesh attribute can be a scalar, a vector, a matrix, or their corresponding quantized versions. In this FEM example, each vertex has three attributes: the position pos, the velocity vel and the force applied to it force. All three attributes are floating-point type three-dimensional vectors based on the Taichi type system. Each (tetrahedral-)cell in the mesh has two attributes: the rest-pose volume w which is a floating-point scalar, and the inverted rest-pose shape matrix B which is a 3 × 3 matrix. The code snippet defining the mesh elements is listed below.
mesh.verts.place({'pos' : ti.math.vec3,
'vel' : ti.math.vec3,
'force' : ti.math.vec3})
mesh.cells.place({'B' : ti.math.mat3,
'w' : ti.f32})Note: For most mesh-based applications, the position of vertices is a crucial attribute provided by the mesh file. We provide the following API to get the vertex position of the current mesh to a NumPy array and load into a mesh attribute:
mesh.verts.pos.from_numpy(mesh.get_position_as_numpy())
The mesh computations are declared within a mesh-for of a kernel, which can be as simple as shown below.
# parallel loop over all mesh cells
for c in mesh.cells:
...
# parallel loop over all mesh vertices
for v in mesh.verts:
...A mesh-for has very similar syntax as a range-for which loops over the indices in an interval. It is specified with a mesh object’s element type (e.g., cells or vertices). Each element inside a mesh is queried with an index-free reference style. The elements’ indices and their corresponding memory addresses are hidden from the users. Our compiler parallelizes the outermost mesh-for loops with high-performance kernels, so that the looped mesh elements are efficiently computed in parallel.
Most mesh-based operations involve not only the attributes of an element, but the attributes of the neighboring elements as well. Our compiler allows users to access neighbor attributes either with reference-based queries using another nested sequential mesh-for loop or with index-based queries using a range-for loop as shown below.
for c in mesh.cells:
total_force = c.verts[0].force
# reference-based access
for v in c.verts:
total_force += v.forcefor c in mesh.cells:
total_force = c.verts[0].force
# index-based access
for i in range(c.verts.size):
total_force += c.verts[i].forceNow we have the way to access the neighbors. Let us wrap everything up and write a substep() function to calculate the force (according to Eq. 1) and perform explicit time integration in a finite element simulation:
@ti.kernel
def substep():
for c in mesh.cells:
Ds0 = c.verts[0].pos - c.verts[3].pos
Ds1 = c.verts[1].pos - c.verts[3].pos
Ds2 = c.verts[2].pos - c.verts[3].pos
F = ti.Matrix(Ds0, Ds1, Ds2).transpose() @ c.B
J = F.determinant()
F_ti = F.transpose().inverse()
P = (F - F_ti) * mu + F_ti * la * ti.log(J)
H = -c.w * P @ c.B.transpose()
c.verts[0].force += H[:, 0]
c.verts[1].force += H[:, 1]
c.verts[2].force += H[:, 2]
c.verts[3].force += -H[:, 0] - H[:, 1] - H[:, 2]
for v in mesh.verts:
# assuming unit mass for simplicity
v.vel += dt * v.force
v.pos += dt * v.velRecall that we visit all elements in a mesh-for using their references, users do not need to bookkeep their corresponding indices. However, there are cases where the indices of elements are wanted. In these cases, we refer users to visit the id attribute of an element. We demonstrate an example to export the positions of vertices to an external multi-dimensional array as follows:
# An 1D array of len(mesh.verts) 3D f32 vectors
pos_ex = ti.Vector.field(3, ti.f32, shape=len(mesh.verts))
# export using id attribute
@ti.kernel
def export():
for v in mesh.verts:
pos_ex[v.id] = v.pos
# export using built-in method
pos_ex.copy_from(mesh.verts.pos)For more details of the usage of our programming language, please refer to our paper or see the examples in this repo.
We test MeshTaichi on a variety of physically-based simulation and geometry processing applications with both triangle and tetrahedron meshes. MeshTaichi achieves a consistent speedup ranging from 1.4× to 6×, compared to state-of-the-art mesh data structures and compilers.
To reproduce the mass-spring system:
cd mass_spring && python3 ms.py --model models/armadillo0.1.node --arch [cpu/cuda]For more details, please refer to this documentation.
To reproduce the projective dynamics:
cd projective_dynamics && python3 pd.py --model models/deer.1.node --arch [cpu/cuda]For more details, please refer to this documentation.
To reproduce the XPBD cloth simulation:
cd xpbd_cloth && python3 models/gen_cloth.py && mkdir results && python3 run_multiple.py --output ./results --arch [cpu/cuda]For more details, please refer to this documentation.
To reproduce the mesh-grid hybrid simulation:
cd lag_mpm && mkdir results && python3 run.py --output ./results && python3 render_particles.pyFor more details, please refer to this documentation.
To reproduce the vertex normal:
cd vertex_normal && python3 normal.py --model models/bunny.obj --arch [cpu/cuda]To reproduce the geodesic distance:
cd geodesic_distance && python3 geodesic.py --model models/yog.obj --output colored.obj --arch [cpu/cuda]@article{Yu2022MeshTaichi,
title = {MeshTaichi: A Compiler for Efficient Mesh-based Operations},
author = {Yu, Chang and Xu, Yi and Kuang, Ye and Hu, Yuanming and Liu, Tiantian},
journal = {ACM Transactions on Graphics (TOG)},
volume = {41},
number = {6},
year = {2022},
issue_date = {December 2022},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
issn = {0730-0301},
url = {https://doi.org/10.1145/3550454.3555430},
doi = {10.1145/3550454.3555430},
month = {dec},
articleno = {252},
numpages = {18}
}
