Abstract

Presented in this paper is an efficient cutting area detection algorithm for the layer-by-layer roughing process of the meshed surfaces in stereolithography (STL) format. The algorithm consists of three steps. Firstly, the intersecting model of a spatial triangle facet and a plane is established and formulated. Based on this, all the intersecting segments between the assigned hunting plane and the triangle meshes in the STL model are calculated. These segments are unordered initially, so in the second step, by building a special data structure, an O(nlogn) time-linking procedure is developed to link the unordered intersecting segments into several closed loops, where n is number of intersecting segments. Finally, the cutting area is identified from the obtained loops by inheritance tree analysis. The proposed algorithm has been programed and run on a personal computer. Several STL surfaces have been tested and the results show that the proposed algorithm is fast and stable.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.