椭圆-椭圆静动态不适合边界算法  

Dynamic and static No Fit Boundary algorithm for ellipse-ellipse

作　　者：陈羽[1] 滕弘飞[1] 

机构地区：[1]大连理工大学机械工程学院,辽宁大连116024

出　　处：《大连理工大学学报》2003年第6期779-782,共4页Journal of Dalian University of Technology

基　　金：国家自然科学基金资助项目(50073036;60175009;60275019);教育部博士学科点专项科研基金资助项目(20010141005).

摘　　要：目前,计算二维几何图形是否干涉的不适合多边形(NFP)算法,针对的是多边形,尚未涉及椭圆-椭圆不干涉计算问题.因此,基于NFP法概念,提出椭圆-椭圆之间的不干涉算法,称之为不适合边界算法;进而给出了既相对平动又相对转动的椭圆-椭圆间任一时刻的动态不干涉边界算法.该法可应用于求解Packing问题、机器人路径规划、虚拟装配、医疗内外科手术等领域.No Fit Polygon (NFP) is a popular method to calculate the non-interference boundary of two-dimensional geometric figures, but it only works when the objects are polygons. Based on the conception of NFP, a non-interference boundary algorithm for ellipse-ellipse, called No Fit Boundary (NFB) algorithm is presented. It can be applied to both static case where no relative movement occurs between two figures, and the dynamic case in which a figure moves to the other with relative rotation. This algorithm can be applied to packing problem, robot motion planning, virtual assembly, medical and surgical operations and so on.

关 键 词：计算机图形学 椭圆 干涉 动态 算法 不适合边界 

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