Bppeizhuna

第27章 透明位图背景上的滚动字幕实例该程序可以方便实现字幕的滚动效果，程序简单易懂(transparent bitmap on the background of rolling subtitles examples of the procedures to facilitate the achievement of subtitles rolling results, procedures simplified)

visual c++ 工具 c语言 实现的灰度共生矩阵。(visual c++ tool c language GLCM.)

VC和OpenGL实现的点云读取界面，需要的朋友可以下载参考(VC and OpenGL realize the point cloud to read interface, the need for a friend can download the reference)

VC的图形处理以及简单的程序设计，简单易懂(VC graphics processing and simple program design, simple and understandable )

基于OpenCV实现的图像切割程序，通过程序中参数设置分块的数量和大小(The project is uesd to break an image into block)

GraphCut算法的实现，跟踪主动镜头下的目标，效果很好！(GraphCut algorithm to track the goal of the initiative under the lens, very good!)

图像处理缩放，大小随意改变，平滑处理，基于vb6.0设计(Zoom image processing, size change, smooth deal, based on the design VB6.0)

施法中新版《计算几何与计算机图形学》，书中所带光盘，包含书中源码和其团队开发的软件，能够实现曲线曲面拟合和编辑(The new cast of Computational Geometry and Computer Graphics , the book brought the disc that contains the source code in the book and his team developed software enables curve and surface fitting and edit)

这里的图像增强包括灰度修正、平滑、滤波、锐化等，是图像处理的基本操作，本代码调试通过(Here, including gray-level correction image enhancement, smoothing, filtering, sharpening, etc., is the basic image processing operations, the code debugging by)

一个集成的图形界面的程序，可调用每一次作业子程序。 一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。 二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。 三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。） 五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 六、交互式Bezier曲线的输入绘制程序实现 (An integrated graphical interface of the program, each operation subroutine callable. One call a function of the point of the painting, with the DDA, the midpoint algorithm for drawing a straight line and the midpoint algorithm circle and oval. Second, the polygon scan conversion algorithm and region filling algorithm (scan line algorithm for must fill and edge flag algorithm based on the edge of the modulo operator is optional using the 4 regional connectivity recursive seed filling algorithm based on the area of seed filling, or scan line seed filling algorithm requires the seed point (x, y) can be entered interactively). Line Clipping polygon clipping algorithm animation achieved. (Two Line Clipping Algorithm and HS polygon-by-side clipping algorithm) polygon clipping algorithm animation requires draw a closed polygon, rectangle and then draw the crop window, and then select the the cropped button (or command), press the "on top of cutting "button (or the implementation of)