橡皮筋模型中凸壳生成与简化方法研究
|
摘要
针对基于物理学的橡皮筋模拟紧凑布局中凸壳的生成和简化问题,提出一种弦比垂智能方法来有效解决特定布局条件下的图形生成与简化。文中针对待布局组件的凸壳特征进行区域分割,对需要简化或不需要简化的区域分类分析,在满足简化前后面积比值等约束的条件下,根据布局条件试取图形简化过程中的阈值级数等进行图形智能简化,获得简化后的凸壳模型。该方法可有效降低待布局组件的图形的复杂性,进而减少布局运动过程中的碰撞检测,缩短实现布局紧凑的时间。通过开发的模拟系统对4个组件在不同阈值级数下的生成与简化过程进行模拟,并将其方法应用在基于橡皮筋的钣金紧凑排样过程中,来验证方法的有效性。
This paper proposes an intelligent algorithm of chord length divide vertical height to solve the problem of the generation and simplification of convex hull in the compact layout of rubber-band analog based on the principles of physics. The area whether needs to be simplified or not, is partitioned and analyzed according to the characteristics of convex hull; with the area constraints of prior to and after the simplification, the threshold level is employed to achieve the intelligent simplification according to the layout conditions, and then the simplified convex hull is obtained. This method, advantageous to decrease the graphic complexity of layout components, can reduce the complexity of motor process and shorten the time of realizing the compact layout. The generation and simplification processes of four components at different threshold levels are simulated with the aid of the analog system, and the proposed method is applied in the compact layout of sheet metal. The results show that the method is effective.
This paper proposes an intelligent algorithm of chord length divide vertical height to solve the problem of the generation and simplification of convex hull in the compact layout of rubber-band analog based on the principles of physics. The area whether needs to be simplified or not, is partitioned and analyzed according to the characteristics of convex hull; with the area constraints of prior to and after the simplification, the threshold level is employed to achieve the intelligent simplification according to the layout conditions, and then the simplified convex hull is obtained. This method, advantageous to decrease the graphic complexity of layout components, can reduce the complexity of motor process and shorten the time of realizing the compact layout. The generation and simplification processes of four components at different threshold levels are simulated with the aid of the analog system, and the proposed method is applied in the compact layout of sheet metal. The results show that the method is effective.
引文
[1] Fadel G M, Sinha A. Packing optimization using a rubberband analogy[C]//Proceedings of ASME,DETC 2001.
[2] Hong Dong. Physics-based shape morphing and packing forlayout desgin[D]. South Carolina:The Graduate School ofClemson University,2008.
[3] Liao Xiaoping, Lu Juan, Ma Junyan, et al. Modeling of 2Dlayout design system based on convex hull plus rubber bandanalog[J]. Applied Mechanics and Materials, 2012,215-216:1219-1223.
[4]张云龙,王进,陆国栋.产品廓形曲线的几何特征语义描述与风格解析技术[J].计算机辅助设计与图形学学报,2013, 25(11):1735-1745.
[5]詹海生.实时图形处理关键技术研究[D].西安:西安电子科技大学, 2006.
[6]甘勇,孙宁,孔庆华.面向均质实体的产品轮廓反求工程[J].机械设计, 2008, 25(10):8-11.
[7]雷华堂,熊鹰,田亚铃,等.反求工程中ICT图像对称轮廓自动识别[J].机械设计, 2011, 28(3):19-22.
[8] Graham R L. An efficent algortithm for determine the convexhull of a finite lianar set[J].Information Processing Letters,1972(1):132-133.
[9]吴中海,叶澄清.一个改进的简单多边形凸包算法[J].计算机辅助设计与图形学学报, 1997, 9(1):9-13.
[10] Bronnimann H,Iacono J. Space-efficient planar convex hullalgorithms[J]. Theoretical Computer Science,2004,321(1):25-40.
[11]赵军,高满屯,王三民.求平面多边形集凸壳的方法[J].计算机工程与应用, 2011, 47(1):205-207.
[12]刘斌,王涛.一种高效的平面点集凸包递归算法[J].自动化学报, 2012, 38(8):1375-1379.
[13] Yin P Y. An ant colony search algorithms for optimal polygo-nal approximation of plane curves[J].Pattern Recognition,2003,23(8):1783-1797.
[14] Bistwajit Sarkar,Lokendra Kumar Singh,Debranjan Sarkar.Agenetic algorithm-based approach for detection of signifi-cantvertices for polygonal approximation of digital curves[J].International Journal of Image and Graphics,2004,4(2):223-239.
[15]王斌,施朝健.用混合遗传算法求解两类多边形近似问题[J].电子学报, 2007,35(8):1527-1532.
[16]邓敏,陈杰,李志林,等.曲线简化中节点重要性度量方法比较及垂比弦法的改进[J].地理与地理信息科学,2009, 25(1):40-43.
[2] Hong Dong. Physics-based shape morphing and packing forlayout desgin[D]. South Carolina:The Graduate School ofClemson University,2008.
[3] Liao Xiaoping, Lu Juan, Ma Junyan, et al. Modeling of 2Dlayout design system based on convex hull plus rubber bandanalog[J]. Applied Mechanics and Materials, 2012,215-216:1219-1223.
[4]张云龙,王进,陆国栋.产品廓形曲线的几何特征语义描述与风格解析技术[J].计算机辅助设计与图形学学报,2013, 25(11):1735-1745.
[5]詹海生.实时图形处理关键技术研究[D].西安:西安电子科技大学, 2006.
[6]甘勇,孙宁,孔庆华.面向均质实体的产品轮廓反求工程[J].机械设计, 2008, 25(10):8-11.
[7]雷华堂,熊鹰,田亚铃,等.反求工程中ICT图像对称轮廓自动识别[J].机械设计, 2011, 28(3):19-22.
[8] Graham R L. An efficent algortithm for determine the convexhull of a finite lianar set[J].Information Processing Letters,1972(1):132-133.
[9]吴中海,叶澄清.一个改进的简单多边形凸包算法[J].计算机辅助设计与图形学学报, 1997, 9(1):9-13.
[10] Bronnimann H,Iacono J. Space-efficient planar convex hullalgorithms[J]. Theoretical Computer Science,2004,321(1):25-40.
[11]赵军,高满屯,王三民.求平面多边形集凸壳的方法[J].计算机工程与应用, 2011, 47(1):205-207.
[12]刘斌,王涛.一种高效的平面点集凸包递归算法[J].自动化学报, 2012, 38(8):1375-1379.
[13] Yin P Y. An ant colony search algorithms for optimal polygo-nal approximation of plane curves[J].Pattern Recognition,2003,23(8):1783-1797.
[14] Bistwajit Sarkar,Lokendra Kumar Singh,Debranjan Sarkar.Agenetic algorithm-based approach for detection of signifi-cantvertices for polygonal approximation of digital curves[J].International Journal of Image and Graphics,2004,4(2):223-239.
[15]王斌,施朝健.用混合遗传算法求解两类多边形近似问题[J].电子学报, 2007,35(8):1527-1532.
[16]邓敏,陈杰,李志林,等.曲线简化中节点重要性度量方法比较及垂比弦法的改进[J].地理与地理信息科学,2009, 25(1):40-43.