dc.contributor.author |
Panyukova T.A. |
en |
dc.date.accessioned |
2018-10-16T06:54:32Z |
|
dc.date.available |
2018-10-16T06:54:32Z |
|
dc.date.issued |
2007 |
|
dc.identifier.issn |
10642307 |
|
dc.identifier.uri |
http://dspace.susu.ru/handle/0001.74/20751 |
|
dc.description.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. © Nauka/Interperiodica 2007. |
en] |
dc.language.iso |
English |
|
dc.relation.ispartof |
Journal of Computer and Systems Sciences International |
en] |
dc.subject |
Algorithms |
en] |
dc.subject |
Computational complexity |
en] |
dc.subject |
Control system analysis |
en] |
dc.subject |
Graph theory |
en] |
dc.subject |
Logic design |
en] |
dc.subject |
Numerical methods |
en] |
dc.subject |
Chain sequences |
en] |
dc.subject |
Cutting design |
en] |
dc.subject |
Numerical control machines |
en] |
dc.subject |
Ordered enclosing |
en] |
dc.subject |
Systems science |
en] |
dc.title |
Chain sequences with ordered enclosing |
en |
dc.type |
Article |
en] |
dc.identifier.doi |
10.1134/S1064230707010108 |
|
dc.identifier.scopus |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-33947131098&doi=10.1134%2fS1064230707010108&partnerID=40&md5=03ab8c32856bbd09b19e74d7e6546bd4 |
|