Welcome![Sign In][Sign Up]
Location:
Search - bresenham line algorithm in opengl

Search list

[OpenGL program6.0MFC_OPENGL_PFbresenham

Description: 基于MFC中Opengl环境的bresenham直线生成算法,可由对话框输入起始点和终点,直观地观察bresenham算法的原理。-based MFC Opengl environment bresenham line drawing algorithm, from the dialog box input starting and stopping points, and visual observation of the principle bresenham algorithm.
Platform: | Size: 61440 | Author: | Hits:

[OpenGL programopenglline

Description: 程序使用了Bresenham算法的思想,将四个象限的问题通过交换端点的方法合并成一,四象限的问题。再利用sign变量,统一成一个问题。又考虑到斜率<1,>1最终问题分成了两种情况。在直线插补程序的一开始,把斜率为正无穷的情况单独进行讨论。最终完成了整个程序-procedures for the use of the Bresenham algorithm thinking, four quadrant of the issue through the exchange of endpoint merged into one, the four quadrant. Reuse sign variables, as a unified problem. Also, in consideration of the slope
Platform: | Size: 87040 | Author: 吴子朝 | Hits:

[OpenGL programbresenham

Description: 用C语言结合OpenGL技术实现Bresenham算法绘制直线-Using C language combined with OpenGL technology to achieve Bresenham algorithm for drawing a straight line
Platform: | Size: 1024 | Author: 王栋 | Hits:

[OpenGL programdrawLine

Description: 计算机图形学OPENGL直线生成算法的实现程序: 1.采用键盘输入的方式输入直线段的两端点 2.实现BRESENHAM直线生成算法-Computer Graphics OPENGL linear algorithm to generate the procedure: 1. The use of keyboard input enter the two end points of line segment 2. The realization of a straight line Bresenham Algorithm
Platform: | Size: 1024 | Author: huang | Hits:

[OpenGL programDDA

Description: DDA 算法 achieve DDA line drawing algorithm, the Bresenham algorithm, which generates the midpoint painted circle algorithm, and polygon scan line filling algorithm -DDA algorithm achieve DDA line drawing algorithm, the Bresenham algorithm, which generates the midpoint painted circle algorithm, and polygon scan line filling algorithm
Platform: | Size: 1024 | Author: | Hits:

[OpenGL programlineBres

Description: 初学Opengl,从最基础开始,本程序实现用Bresenham算法画直线-Learning Opengl, from the beginning of the most basic, the program Bresenham algorithm for drawing a straight line with
Platform: | Size: 1024 | Author: wgj | Hits:

[OpenGL program20091227linebresenham2

Description: 本文对直线的生成的3种算法:逐点比较法、数值微分法(DDA法)、Bresenham算法进行研究。本文对逐点比较法、数值微分法(DDA法)、Bresenham算法进行推导,研究了逐点比较法、数值微分法(DDA法)、Bresenham算法在第一象限的实现和改进后逐点比较法、数值微分法(DDA法)、Bresenham算法在所有象限的实现。通过编程实践,可以掌握VC和opengl的使用方法。-In this paper, a straight line generated by three kinds of algorithms: point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm research. In this paper, point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm is derived to study the by-point comparison method, numerical differential method (DDA Act), Bresenham algorithm in the first quadrant of the implementation and improved point by point comparison method , numerical differential method (DDA Act), Bresenham algorithm for the realization in all quadrants. By programming practice, you can master the VC and opengl is used.
Platform: | Size: 205824 | Author: aliang | Hits:

[OpenGL program20091227line

Description: 本文对直线的生成的3种算法:逐点比较法、数值微分法(DDA法)、Bresenham算法进行研究。本文对逐点比较法、数值微分法(DDA法)、Bresenham算法进行推导,研究了逐点比较法、数值微分法(DDA法)、Bresenham算法在第一象限的实现和改进后逐点比较法、数值微分法(DDA法)、Bresenham算法在所有象限的实现。通过编程实践,可以掌握VC和opengl的使用方法。-In this paper, a straight line generated by three kinds of algorithms: point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm research. In this paper, point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm is derived to study the by-point comparison method, numerical differential method (DDA Act), Bresenham algorithm in the first quadrant of the implementation and improved point by point comparison method , numerical differential method (DDA Act), Bresenham algorithm for the realization in all quadrants. By programming practice, you can master the VC and opengl is used.
Platform: | Size: 208896 | Author: aliang | Hits:

[OpenGL program20091227linebresenham_old

Description: 本文对直线的生成的3种算法:逐点比较法、数值微分法(DDA法)、Bresenham算法进行研究。本文对逐点比较法、数值微分法(DDA法)、Bresenham算法进行推导,研究了逐点比较法、数值微分法(DDA法)、Bresenham算法在第一象限的实现和改进后逐点比较法、数值微分法(DDA法)、Bresenham算法在所有象限的实现。通过编程实践,可以掌握VC和opengl的使用方法。-In this paper, a straight line generated by three kinds of algorithms: point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm research. In this paper, point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm is derived to study the by-point comparison method, numerical differential method (DDA Act), Bresenham algorithm in the first quadrant of the implementation and improved point by point comparison method , numerical differential method (DDA Act), Bresenham algorithm for the realization in all quadrants. By programming practice, you can master the VC and opengl is used.
Platform: | Size: 204800 | Author: aliang | Hits:

[OpenGL program20091227linedda

Description: 本文对直线的生成的3种算法:逐点比较法、数值微分法(DDA法)、Bresenham算法进行研究。本文对逐点比较法、数值微分法(DDA法)、Bresenham算法进行推导,研究了逐点比较法、数值微分法(DDA法)、Bresenham算法在第一象限的实现和改进后逐点比较法、数值微分法(DDA法)、Bresenham算法在所有象限的实现。通过编程实践,可以掌握VC和opengl的使用方法。-In this paper, a straight line generated by three kinds of algorithms: point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm research. In this paper, point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm is derived to study the by-point comparison method, numerical differential method (DDA Act), Bresenham algorithm in the first quadrant of the implementation and improved point by point comparison method , numerical differential method (DDA Act), Bresenham algorithm for the realization in all quadrants. By programming practice, you can master the VC and opengl is used.
Platform: | Size: 211968 | Author: aliang | Hits:

[OpenGL program20091227sierpinski

Description: 本文对直线的生成的3种算法:逐点比较法、数值微分法(DDA法)、Bresenham算法进行研究。本文对逐点比较法、数值微分法(DDA法)、Bresenham算法进行推导,研究了逐点比较法、数值微分法(DDA法)、Bresenham算法在第一象限的实现和改进后逐点比较法、数值微分法(DDA法)、Bresenham算法在所有象限的实现。通过编程实践,可以掌握VC和opengl的使用方法。-In this paper, a straight line generated by three kinds of algorithms: point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm research. In this paper, point by point comparison method, numerical differential method (DDA Act), Bresenham algorithm is derived to study the by-point comparison method, numerical differential method (DDA Act), Bresenham algorithm in the first quadrant of the implementation and improved point by point comparison method , numerical differential method (DDA Act), Bresenham algorithm for the realization in all quadrants. By programming practice, you can master the VC and opengl is used.
Platform: | Size: 202752 | Author: aliang | Hits:

[OpenGL programopenGL

Description: 此程序的功能是实现基本的openGL中的画线算法,总共有四个算法。DDA画线算法,中点Bresenham算法画直线,改进Bresenham算法画直线以及 四分法绘制椭圆-Feature of this program is to achieve the basic openGL draw lines in the algorithm, a total of four algorithms. DDA line drawing algorithm, Bresenham midpoint line drawing algorithm, improved Bresenham algorithm for drawing a straight line and ellipse drawing quartering
Platform: | Size: 1732608 | Author: 周中锋 | Hits:

[OpenGL programopengl

Description: 使用OpenGL实现DDA、中点画线法、Bresenham算法绘制;中点画圆法、Bresenham画圆算法;多边形扫描线转换算法;多边形裁剪--逐边裁剪法等计算机图形学基本算法。-Use OpenGL, DDA, the dotted line method, Bresenham algorithm to draw midpoint drawcircle, Bresenham circle algorithm polygon scan line conversion algorithm polygon clipping- cutting edge of law by the basic algorithm in computer graphics.
Platform: | Size: 4977664 | Author: | Hits:

[Other计算机图形学

Description: 在vc++6.0环境下,基于OPENGL实现图形学设计内容。包括实现五边形到五角星的动态变换;利用DDA、中点画线法、Bresenham算法画直线;利用中点画圆法、Bresenham算法画圆;利用栅栏填充、扫描线填充实现多边形内部颜色填充;以及实现二维图形、三维图形的平移、放大、缩小、对称、旋转、错切等基本图形变换。(In vc++6.0 environment, we design content based on OPENGL. It includes the dynamic transformation of Pentagon to pentagonal star, using DDA, middle point drawing and Bresenham algorithm to draw straight lines; using middle point drawing circle method and Bresenham algorithm to draw circle; using fence filling and scanning line filling to fill in polygon interior color filling; and realizing the translation, enlargement and reduction of two-dimensional graphics and 3D graphics. Basic graphic transformation, such as symmetry, rotation, and error cutting.)
Platform: | Size: 4198400 | Author: 水无缘 | Hits:

CodeBus www.codebus.net