Recursive Layered Algorithm with Directive Weighted Graph Based on Packet Sequencing

被引：0

作者：

Wang, Lei ^{[1
]}

Hu, Yan-Juan ^{[2
]}

Wang, Yao ^{[3
]}

机构：

[1] Jilin Univ, Coll Mech Sci & Engn, Changchun 130025, Peoples R China

[2] Changchun Univ Technol, Coll Elect & Mech Engn, Changchun 130012, Peoples R China

[3] Beihua Univ, Mech Engn Coll, Changchun 130021, Peoples R China

来源：

2015 INTERNATIONAL CONFERENCE ON MECHANICAL SCIENCE AND MECHANICAL DESIGN, MSMD 2015 | 2015年

关键词：

STL model; Packet sequencing; Directive weighted graph; Layered algorithm;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This article analyzed the hierarchical algorithm of present STL models, based on which put forward the recursive layered algorithm with directive weighted graph based on packet sequencing. Use the triangle grouped ordering to reduce the number of the intersection judgments, to avoid the necessity of traversal all the triangle patches in each searching process. Simplify the topological relation by founding the Directive Weighted Graph and building up the adjacency relation between the triangle patches. We solved the problems of the triangle's point cut emerged in the recursive slice by building up the recursive search functions with the deep optimized traversing method, and sealed the sections' contours. Experimental results show that, this function can not only slice the STL models efficiently, but also promise a steady and efficient slicing process.

引用

页码：8 / 14

页数：7