Abstract
To enhance the efficiency of numerical control machines for cutting of sheet material, a method of searching for the cutter trajectory as a path with ordered enclosing in the flat graph G = (V, E) corresponding to the cutting design is proposed. It is shown that this path can be represented as a sequence of no more than n/2 + 1 chains with ordered enclosing, where n is the number of odd-order vertices in G. An algorithm for finding the sought sequence of chains, with a complexity of O(|E|) is developed.
Sign-in/Register to access full text options 
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 callMore From: Journal of Computer and Systems Sciences International
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.
