This paper present an efficient slicing procedure of face-vertex triangle mesh for addictive manufacturing.The proposed algorithm introduces the use of connectivity representation of face-vertex triangle mesh,including incidence,adjacency,and ordering,in the slicing of triangle mesh.Secondly,based on the triangle mesh interval tree data structure,efficient intersection query method of triangle mesh and slicing plane is established,and the method can find all the triangles in a large scale triangle mesh that intersect the given slicing plane in O(logn+k)time,where k is the number of retrieved triangles.Finally,an efficient slicing algorithm for addictive manufacturing,which is based on the connectivity representation of face-vertex triangle mesh and triangle-plane intersection query method,is proposed.The intersection calculation of plane and triangle mesh is discussed in four different situations.Thanks to the use of triangle mesh connectivity representation,the triangle mesh slicing algorithm proves to be very efficient.Several experimental results are studied to verify the robustness and performance of the proposed algorithm.