Rapid Slicing Algorithm Based on Geometry Continuity for RPM
Jun Zhu · Zhongguo jixie gongcheng · 2000
Slicing of STL Model is a fundamental data transfer task for RPM. The existing slicing algorithm based on topology information extracted from STL has high efficiency in searching intersecting facets,however, due to global topology information extraction, a greater amount of inner memory is occupied,while a lot of time is needed for this operation. This paper proposes an idea of slicing on the basis of geometry continuity. By generating new intersecting facets table of each slicing plane and extracting only topology information of the current slicing plane, inner memory is remarkably saved, while the extracting time is also saved to some extent. Besides these merits, incremental method is used to generate slice contours instead of the previous one getting each slicing contour separatly, which contributes to improvement of slicing efficiency futher.