期刊文献+

椭圆-矩形的静动态不适合边界算法 被引量:2

A Static and Dynamic No Fit Boundary Approach for Ellipse-Rectangle
下载PDF
导出
摘要 在求解Packing问题、机器人路径规划、虚拟装配、碰撞检测等常用到椭圆-矩形的不干涉算法。针对椭圆和矩形分别在静止、运动状态下的不干涉问题,该文在Adamowicz&Albano的NFP基础上,给出了椭圆-矩形的静、动态不适合边界(NoFitBoundary,NFB)的定义,用图形变换方法证明了静态不适合边界是由4条线段和4段椭圆弧组成的对称曲八边形,给出了对称曲八边形顶点计算公式,提出了椭圆-矩形的静、动态不干涉算法。该算法简单且具有一定的应用价值。 When resolving problem of interference such as packing,robot motion planning,virtual assembly,collision detection and so on,the interference algorithm for ellipse-rectangle is often used.Aiming at problem of judgment on the non-interference for ellipse and rectangle at static and dynamic situation respectively,this paper defines a no fit boundary(NFB) for ellipse-rectangle based on the conception of no fit polygon (NFP) given by Adamowicz & Albano, using graphics transformation method proves that static no fit boundary for ellipse-rectangle is a symmetrical curvilinear octagon which consists of four line segments and four elliptical arcs.Furthermore the simple formulas to compute the apex of the No fit Boundary are given and corresponding non-interference algorithm is presented in this paper.The algorithm is simple and is of the certain value of application.
出处 《计算机工程与应用》 CSCD 北大核心 2006年第5期1-3,7,共4页 Computer Engineering and Applications
基金 国家自然科学基金资助项目(编号:50575031)
关键词 计算机图形学 椭圆 矩形 不适合边界 computer graphics, ellipse, rectangle, Not Fit Boundary
  • 相关文献

参考文献9

  • 1Art R C.An approach to the dimensional irregular cutting-stock problem[R].IBM Cambridge Scientific Center report 36-Y08,Cambridge: IBM Cambridge Scientific Center, 1966.
  • 2Adamowiez M,Albano A,Nesting two dimensional shapes in rectangle modules[J].Computer Aided Design, 1976;8(1 ) :27-33.
  • 3Cunninghame-Green R.Geometry shoemaking and the milk tray problem[J].New Scientist, 1989; 123(1667) :50-53.
  • 4Ghosh P K.A unified computational framework for minkowski operation[J].Computers and Graphics, 1993 ; 17 (4) : 357-378.
  • 5Bennell J A,Dowsland W B.The irregular cutting-stock problem-a new procedure for deriving the NO Fit Polygon[J].Computers and Olaerations Research,2001 ;28(3) :271-287.
  • 6滕弘飞,刘峻,王秀梅,冯恩民,杨宏宇,孙治国.一种矩形的动态不干涉算法[J].中国图象图形学报(A辑),2001,6(3):259-263. 被引量:17
  • 7Dowsland K A,Dowsland W B.Packing problem[J].European Journal of Operational Research, 1992 ; 56 ( 1 ) : 1 - 11.
  • 8陈羽,滕弘飞.椭圆-椭圆静动态不适合边界算法[J].大连理工大学学报,2003,43(6):779-782. 被引量:5
  • 9黎自强,滕弘飞.一个新的椭圆-椭圆的静动态不合适边界算法[J].计算机工程与应用,2004,40(36):38-40. 被引量:4

二级参考文献18

  • 1黄文奇 詹叔浩.求解Packing问题的拟物方法[J].应用数学学报,1979,(2):176-180.
  • 2陈国庆 冯恩民 等.求解一类packing问题的最优化方法--定界锥分拆法[J].吉林工业大学学报(东北地区第六届运筹学学术年会专辑),1990,:62-65.
  • 3Theo Pavlidis 吴成柯(译).计算机图形显示和图象处理的算法[M].北京:科学出版社,1987.350-354.
  • 4ART R C. An approach to the two dimensional irregular cutting stock problem [A]. IBM Cambridge Scientific Center Report 36-Y08 [R].Cambridge: IBM Cambridge Scientific Center,1966.
  • 5ADAMOWICZ M, ALBANO A. Nesting two dimensional shapes in rectangular modules [J].Comput Aided Des, 1976, 8(1): 27-33.
  • 6CUNNINGHAME-GREEN R. Geometry shoemaking and the milk tray problem [J]. New Scientist, 1989,123(1667): 50-53.
  • 7GHOSH P K. A unified computational framework for Minkowski operation [J]. Comput and Graphics, 1993, 17(4): 357-378.
  • 8BENNELL J A, DOWSLAND K A, DOWSLAND W B. The irregular cutting-stock problem-a new procedure for deriving the No Fit Polygon [J].Comput Oper Res, 2001,28(3): 271-287.
  • 9DOWSLAND K A, DOWSLAND W B. Packingproblem [J]. Euro J Oper Res, 1992, 56(1) : 1-11.
  • 10Art R C.An approach to the dimensional irregular cutting-stock problem[R].IBM Cambridge Scientific Center report 36-Y08,Cambridge:IBM Cambridge Scientific Center,1966

共引文献17

同被引文献21

引证文献2

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部