Modified fast algorithm for STL file slicing

STL is an Ad Hoc standard in rapid prototyping manufacturing.An efficient STL slicing algorithm is necessary for high quality prototype production.In this paper,we proposed a fast slicing algorithm based on recursion and searching direct graph with weight.In this method,the time consuming of creating direct graph was eliminated.Then the slicing data was postprocessed to get rid of the redundant points.Thus the slicing speed can be accelerated substantially.Lots of experiments and data analysis validate our new slicing algorithm.