返回
A generalized collision algorithm for geometric graphics
DOI:10.1007/s00500-022-06883-6.png)
摘要
En 中文
The two-dimensional graphical nesting problem is widespread in industrial production and is an NP-complete problem. The core technology of various nesting methods is the graphical collision algorithm. In this paper, a general algorithm for geometric graphics is proposed. According to the geometrical characteristics of the packed parts, the idea of divide and conquer is adopted, and the corresponding collision strategies are designed, respectively. Two-point bidirectional collision calculation, aligned bidirectional collision and slipping calculation are proposed to determine the collision relationship between graphics. The interpolation strategy is used to reduce the computation of NFP (No-Fit-Polygon). The precise interpolation between graphics is achieved by first marking and positioning, and then sliding interpolation in both directions, which improves the interpolation efficiency. Finally, the results of the comparison test by several cases of different types show that the algorithm is effective, stable, reliable and adaptable.
Keyword:
Geometry
Collision algorithm
Slipping collision
Marking and inserting
Packing
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
暂无机构信息
引用论文
California encephalitis virus development in mosquitoes as revealed by transmission studies, immunoperoxidase staining, and electron microscopy加利福尼亚脑炎病毒在蚊虫中的发育,通过传播研究、免疫过氧化物酶染色和电子显微镜观察揭示
Orientational variable-length strip covering problem: A branch-and-price-based algorithm定向可变长度条带覆盖问题: 一种基于分支和价格的算法
New data about home range and movements of Oligoryzomys flavescens (Rodentia: Cricetidae) help to understand the spread and transmission of Andes virus that causes Hantavirus Pulmonary Syndrome关于Oligoryzomys flavescens(啮齿目:棉鼠亚科)的家园范围和活动的新数据,有助于理解导致汉坦病毒肺综合征的安第斯病毒的传播和传播。

