期刊文献+

基于直线特性的直线生成集成算法 被引量:5

A Property-Based Integrated Line-Generating Algorithm
在线阅读 下载PDF
导出
摘要 在分析和比较了现有的直线生成算法后 ,以 Bresenham算法为基础 ,充分利用直线的对称性、方向性和连续性 ,设计了一个基于直线特性的直线生成集成算法 ,以进一步提高直线生成速度 .实验表明 ,该集成算法与 Bre-senham算法相比 ,直线绘制速度提高了 5 0 %以上 .特别是在工程图样中 ,由于绝大部分直线为水平线、垂直线、±45°方向直线 ,因此本算法将更为有效 . Present line-generating algorithms, which include Bresenham algorithm, symmetrical algorithm and the algorithm based on the chain code theory of the line, are analyzed and compared in this paper. A property-based on the chain code theory of the line, are analyzed and compared in this paper. A property-based integrated line-generating algorithm, which is based on the Bresenham algorithm and makes full use of the symmetry, direction and continuity of the line, is presented to increase the speed of line generating. The results of our experiments have proved that the line-generating speed of the integrated algorithm is increased by more than 50 percent compared to that of Bresenham algorithm. The new algorithm is especially efficient for engineering drawings, in which the inclinations of most lines are 0°, 180°, ±90°, ±45 °and ±135°. In can be thought that the integrated line-generating algorithm has make great progress in the way to reach the minimum value of the operation time in generating a line. Existing CAD&CG algorithms must take into account the particularity and entireness of the object while the integrity and universality of the processing object is pursued. To handle the related algorithms in some special way according to the characteristics of engineering drawings is an effective method to improve present CAD&CG algorithms.
出处 《中国图象图形学报(A辑)》 CSCD 北大核心 2001年第4期392-395,共4页 Journal of Image and Graphics
基金 863/CIMS主题资助项目! (863 -5 11-9842 -0 0 6)
关键词 BRESENHAM算法 对称性 方向性 连续性 集成算法 工程图样 直线 CAD 直线生成算法 计算机图形学 Bresenham algorithm, Symmetry, Direction, Continuity, Integrated algorithm, Engineering drawings
  • 相关文献

参考文献2

二级参考文献1

共引文献9

同被引文献29

  • 1刘勇奎.一个对称的快速直线生成算法[J].微计算机应用,1993,14(2):42-43. 被引量:9
  • 2义隆电子有限公司.eSLZ000芯片技术资料[Z].2008.
  • 3Bresenham J E.A linear algorithm for incremental digital display of circulararcs[J].Communications of ACM,1977,20(2):100-106.
  • 4Bresenham J E. Algorithms for computer control of a digital plottex[J]. IBM Systems Journal, 1965,4(1):25- 30.
  • 5Wn X. Rakne J G. Double step incremental generation of lines and circles[J]. CVGIP, 1987, 37:331 - 334.
  • 6Bodlaendex H L. A linear- time algorithm for Finding tree decompositions of small treewidth[J]. SIAM J Computer,1996, 25(6): 1305-1317.
  • 7Dujmvic V. On the parameterized complexity of layered graph drawing[A]. In Proc 5th Annual European Symp. on Algorithms (ESA '01), 2001(2161) :488 - 499.
  • 8唐荣锡 汪嘉业 彭群生.计算机图形学教程(修订版)[M].北京:科学出版社,2001.34-38.
  • 9唐荣锡 汪嘉业 等.计算机图形学教程(修订版)[M].北京:科学出版社,2001..
  • 10孙家广.计算机图形学(第3版)[M].北京:清华大学出版社,2000.378.

引证文献5

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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