Introduction - If you have any usage issues, please Google them yourself
3D Sierpinski router pad of the recursive procedure, using a three-dimensional point, because each tetrahedron is convex, so the tetrahedral vertex and any point must be in the tetrahedral interior