arrow
返回

A generalized collision algorithm for geometric graphics

delete2022-03-03
delete0
PRE
AI
P
Pengfei Zheng *
J
Jingjing Lou
C
Chengjie Lian
L
Lin Da-jun
安
安琦 (Qi An)
DOI:10.1007/s00500-022-06883-6delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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

期刊

Soft Computing 封面图
Soft Computing
IF:
2.5
论文数:
1.0W
被引数:
2.1W

机构

暂无机构信息
引用论文

引用论文

Solving robust bin-packing problems with a branch-and-price approach
err2022-03-01
err13
errOAAI
errSchepler, Xavier; Rossi, Andre; Gurevsky, Evgeny; Dolgui, Alexandre
err分享
err收藏
The rectangular two-dimensional strip packing problem real-life practical constraints: A bibliometric overview
err2022-01-01
err32
PREAI
errNeuenfeldt Junior, Alvaro; Silva, Elsa; Francescatto, Matheus; Rosa, Carmen Brum; Siluk, Julio
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容