OpenSceneGraph-Quick-Start-Guide

这是我们计算机图形学的课程设计，有时间不放(This our computer graphics curriculum design, and a link to see time)

graphic game developing source code

说明：  根据图框块自动识别图纸并预览打印。函数参数分别为：打印机名称，打印样式，打印纸张，打印份数，自动纸张，自动旋转，自动关闭，自动识别图框(Autoprint according to the drawing blocks.)

等值线函数.// As this code is ported from FORTRAN-77, please be very careful of the // various indices like ilb,iub,jlb and jub, remeber that C/C++ indices // starts from zero (0)(contour function.// As this code is ported from FORTRAN-77, please be very careful of the// various indices like ilb, iub, and* address, remember that the C/C indices// starts from zero (0))

说明：  一个模拟cad画图的程序,实现了直线,椭圆,圆,矩形等图形的画法.需要安装后才能查看源码和相关文档(cad drawing a simulation procedures to achieve a straight line, oval, round, rectangular and other graphics painting. Installed after looking at the source and related documentation)

可以动态移动的尺度的设计，适合图形显示和控制(The scale can be designed to dynamically move, for graphics display and control)

计算机图形学，mfc实现二维图形的基本几何变换，如平移、旋转、缩放、对称、错切变换(Computer graphics, mfc achieve the basic two-dimensional graphics geometric transformations, such as translation, rotation, scaling, symmetry, shear transformation)

杜晓增计算机图形学基础Bresenham画线源码(Du Xiaozeng computer graphics based Bresenham line source)

计算机图形学_实体构造实验，典型的实体空间旋转(Computer graphics _ entity structure experiments, the typical physical space rotation)

说明：  1． 做一个集成的图形界面的程序，可调用每一次作业子程序。 2． 调用画点的函数，用DDA、中点算法画直线和中点算法及正负法画圆和抛物线。 3． 交互式的二维直线求交：如果存在交点，用实心圆显示交点，并用文字显示其坐标。 4． 用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括自行车行走和绕固定点旋转的自旋转物体动画。） 5． 线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 6． 两种扫描多边形扫描转换算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法任选一种）； 7． 4连通区域的递归种子填充算法，和扫描线种子填充算法，要求种子点(x,y)可交互输入）。 8． 简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 9． 交互式Bezier曲线的输入绘制程序实现 (1. So an integrated graphical interface procedures, which call for each operation subroutine. 2. Calling the painting point function, with DDA, the midpoint algorithm painting line and the midpoint algorithm and France Circle and the positive and negative parabola. 3. Interactive 2D linear intersection : If there intersection with a solid circle indicates Nodal and writing to demonstrate its coordinates. 4. Using 2D animation graphics transform algorithms to achieve the specified physical translation, rotation and scaling. (Including walking and cycling around the fixed point of rotating objects from the rotating animation.) 5. Line cutting and polygon clipping algorithm to achieve the animation demo. (Two segments cutting algorithm and H-S-by-side polygon clipping algorithm) polygon clipp)