Research on the Rapid Slicing Algorithm Based on STL Topology Construction

2010 ◽  
Vol 97-101 ◽  
pp. 3397-3402 ◽  
Author(s):  
Guang Yang ◽  
Wei Jun Liu ◽  
Wei Wang ◽  
Lan Yun Qin

Constructing the topology of STL file efficiently is a key factor to improve the efficiency of slicing algorithm. In this paper a topology construction algorithm based on Standard Template Library set containers and a rapid slicing algorithm are developed. The algorithm developed removes a large number of redundant vertices, and only calculates intersection per triangular facet with slice plane once, and attains another point of intersection directly from the adjacent relations. In addition, the algorithm can reduce the times of traversing and sorting for the triangular facets, and also the times of calculation of intersection in the slicing processes, which results in the simplification of the process of constructing the slice contour, consequently the efficiency of the slicing algorithm is improved.

2014 ◽  
Vol 590 ◽  
pp. 586-590 ◽  
Author(s):  
Hui Qun Yang ◽  
Gui Jun Liu ◽  
Ting Wang

To efficiently construct the topology of STL file is one of the key factors to improve efficiency of slicing algorithm. In this paper a topology construction algorithm based on triangle facets ring and a rapid slicing algorithm are developed, in which the flag variables are defined to reduce search range when slicing. Then the algorithm can reduce the times of traversing and sorting for the triangle facets and the times of calculation intersection in the slicing processes, and it also can simplify the process of constructing the slice contour so as to improve the efficiency of the slicing algorithm.


2012 ◽  
Vol 9 (3) ◽  
pp. 1187-1202
Author(s):  
Zalán Szűgyi ◽  
Márk Török ◽  
Norbert Pataki ◽  
Tamás Kozsik

Nowadays, one of the most important challenges in programming is the efficient usage of multicore processors. All modern programming languages support multicore programming at native or library level. C++11, the next standard of the C++ programming language, also supports multithreading at a low level. In this paper we argue for some extensions of the C++ Standard Template Library based on the features of C++11. These extensions enhance the standard library to be more powerful in the multicore realm. Our approach is based on functors and lambda expressions, which are major extensions in the language. We contribute three case studies: how to efficiently compose functors in pipelines, how to evaluate boolean operators in parallel, and how to efficiently accumulate over associative functors.


Sign in / Sign up

Export Citation Format

Share Document