CSIAM Trans. Appl. Math., 4 (2023), pp. 325-344.
Published online: 2023-02
Cited by
- BibTex
- RIS
- TXT
We present a well improved surface segmentation algorithm for 3-axis/3+2-axis CNC subtractive fabrication. For a free-form surface (represented by the triangular mesh), to avoid collision with the cutter during complex surface machining, it is essential to segment it into several patches. We transform the surface segmentation problem into a mathematical problem based on energy minimization according to several fabrication constraints, and solved by establishing a weighted graph and searching the minimum cut. Our algorithm has simple structure and is easy to implement. Moreover, the algorithm guarantees correctness and completeness in theory, that is, we prove that the weight of the minimum cut is equivalent to the minimum value of the energy function. Experimental results are provided to illustrate and clarify our method.
}, issn = {2708-0579}, doi = {https://doi.org/10.4208/csiam-am.SO-2022-0032}, url = {http://global-sci.org/intro/article_detail/csiam-am/21417.html} }We present a well improved surface segmentation algorithm for 3-axis/3+2-axis CNC subtractive fabrication. For a free-form surface (represented by the triangular mesh), to avoid collision with the cutter during complex surface machining, it is essential to segment it into several patches. We transform the surface segmentation problem into a mathematical problem based on energy minimization according to several fabrication constraints, and solved by establishing a weighted graph and searching the minimum cut. Our algorithm has simple structure and is easy to implement. Moreover, the algorithm guarantees correctness and completeness in theory, that is, we prove that the weight of the minimum cut is equivalent to the minimum value of the energy function. Experimental results are provided to illustrate and clarify our method.