期刊文献+

基于编码与分类技术的任意多边形裁剪新算法 被引量:7

A High Efficient Polygon Clipping Algorithm Against Rectangular Window Based on Encoding and Classification Technique
在线阅读 下载PDF
导出
摘要 首次将编码与分类技术引入任意多边形的矩形窗口裁剪,通过编码分类技术根据多边形边与裁剪窗口的相对位置将边分为六类。采用一次编码技术获取一类窗内边,舍弃二类窗外边,得到必须求交的三类边;采用二次编码技术舍弃四类窗外边,得到需要求交的五、六类边;进一步提出裁剪窗口顶点相对于多边形的分类,利用窗口顶点分类和多边形边的编码特征快速处理三类、五类、六类窗口相交边。通过编码分类技术减少了多边形裁剪的运算量,并有效地维护了多边形的拓扑关系。实验结果表明算法稳定可靠,可实现对任意凹凸多边形的裁剪,在多边形与窗口的各种相对位置均具有较高的运算效率。 Encoding classification technique is firstly applied to polygon-clipping against rectangle window,through which edges of polygon is divided into six kinds according to position relationship between polygon and rectangle window.The first edge located in window is obtained,and the second is abandoned,and the third is sure to need intersection calculation,by use of once encoding technique.Then the forth edge is discarded,the fifth and the sixth are brought about ,which perhaps need for intersection calculation,on basis of twice encoding technique.Further the vertexes of rectangle window are classified,which is based on its position whether in polygon or not.So the third,the fifth,the sixth edge can be quickly handled as well as according to encoding character of polygon edges.As a result,encoding classification is not only reduce calculation in polygon -clipping but also maintain correct topological attributes.The experiment results have proved that new algorithm,which can be used for general concave polygon and convex polygon,further improves the clipping efficiency and it has good stability at same time.
出处 《计算机工程与应用》 CSCD 北大核心 2003年第21期56-58,89,共4页 Computer Engineering and Applications
基金 国家杰出青年基金(编号:6992504) 创新群体科学研究基金(编号:60021201)
关键词 编码分类 多边形 裁剪 拓扑关系 encoding classification,polygon,clipping,topological attributes
  • 相关文献

参考文献10

  • 1王骏,梁友栋,彭群生.具有最少算术运算量的二维线裁剪算法[J].计算机学报,1991,14(7):495-504. 被引量:26
  • 2汪灏泓,吴锐迅,蔡士杰.一种基于几何变换的高效的线裁剪新算法[J].软件学报,1998,9(10):728-733. 被引量:26
  • 3陆国栋,吴?晖.基于变窗口过滤技术的线段裁剪中点分割算法[J].计算机辅助设计与图形学学报,2002,14(6):513-517. 被引量:13
  • 4Newman W M,SprouU R F.Principle of Interactive Computer Graphics[M].New York : McGraw-Hill, 1979.
  • 5Sproull R F,Sutherland I E.A clipping divider[C].In:Fall Joint Computer Con, Washington :Thompson Books, 1968:765-775.
  • 6Liang Y D,Barsky B A.A new concept and method for line clippins[J]. ACM Trans on Graphics,1984;3(1):1-22.
  • 7Nicholl T M,Lee D T,Nicholl R A.An etficient new algorithm for 2D line clipping:its development and analysis[J].Computer Graphics, 1987; 21 (4) : 253-263.
  • 8Guodong Lu,Xuanhui Wu,Qunsheng Peng.An efficient line clipping algorithm based on adaptive line rejection[.l].Computers & Graphics, 2002;26(3) :409-415.
  • 9Sutherland I E,Hodgman G W.Reentrant polygon dipping[J].CACM, 1974; 17:32--42.
  • 10Weiler K,Atherton P.Hidden surface removal using polygon area sorting[J].Computer Graphics, 1977; 11:214--222.

二级参考文献8

共引文献43

同被引文献44

引证文献7

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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