一种高效的三维轮廓曲线匹配算法  

Efficient Matching Algorithm for 3D Contour Curve

作　　者：张海朝[1] 王亚涛[1] 张芳芳[1] 

机构地区：[1]河南科技大学电子信息工程学院,河南洛阳471003

出　　处：《计算机工程》2011年第8期228-230,共3页Computer Engineering

基　　金：洛阳市科技攻关计划基金资助项目(0701041A)

摘　　要：针对三维碎片自动拼接中的碎片匹配问题,提出一种高效的轮廓曲线匹配算法。用B-样条曲线表示三维空间曲线,并计算轮廓曲线上各个点的曲率、挠率和法矢,在匹配过程中,对轮廓特征点按其邻域曲面片进行分类,根据特征点类型标志及特征段之间的欧式距离对不同轮廓上的特征段进行相似性度量,再利用法矢对相似性较高的轮廓段进行可匹配性验证。实验结果证明该算法是稳定、高效的。This paper introduces the single machine total weighted tardiness model with sequence dependent setup times to research Printed Circuit Board（PCB） assembly problem with boards of different types by using a single automated surface mounting line.An improved Ant Colony Optimization（ACO） algorithm is developed for the model.The improved algorithm uses new pheromone upgrade mechanism with tabu table to avoid algorithm from premature convergence.Interactive local search is realized by multithread,and path pool is used to communicate local search and ACO.Test result shows that the improved algorithm can effectively improve the efficiency of PCB assembly,and reduce manufacturing tardiness of the tasks.

关 键 词：轮廓匹配 三维轮廓曲线 曲率 B-样条 特征向量 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]