摘要
An approach is presented to generate rough interference-free tool-paths directly from massive unorganized data in rough machining that is performed by machining volumes of material in a slice-by-slice manner. Unorganized point-cloud is firstly converted to cross-section data. Then a robust data-structure named tool-path net is constructed to save tool-path data. Optimal algorithms for partitioning sub-cut-areas and computing interference-free cutter-locations are put forward. Finally the tool-paths are linked in a zigzag milling mode, which can be transformed into a traveling sales man problem. The experiment indicates optimal tool paths can be acquired, and high computation efficiency can be obtained and interference can be avoided successfully.
An approach is presented to generate rough interference-free tool-paths directly from massive unorganized data in rough machining that is performed by machining volumes of material in a slice-by-slice manner. Unorganized point-cloud is firstly converted to cross-section data. Then a robust data-structure named tool-path net is constructed to save tool-path data. Optimal algorithms for partitioning sub-cut-areas and computing interference-free cutter-locations are put forward. Finally the tool-paths are linked in a zigzag milling mode, which can be transformed into a traveling sales man problem. The experiment indicates optimal tool paths can be acquired, and high computation efficiency can be obtained and interference can be avoided successfully.
