A novel efficient algorithm for surface mesh segmentation

In this paper, we propose a novel point in triangle-mesh polyhedron algorithm, which is based on the Jordan theorem, for surface mesh segmentation. The algorithm tried to find whether there is intersection between the radial initiating from the point and the triangle by judging whether the point is inside a tetrahedron. The point in tetrahedron algorithm could be efficient by simply comparing the volume of the tetrahedron and summation of the volumes of the four small tetrahedrons. The efficiency of the algorithm is greatly improved in comparison with the simple Jordan algorithm.