OpenGLPlat

集装箱的装箱问题: *给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材 *的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装 *箱的空间利用率最高？使用贪心算法解决。 *编译方法：打开cpp文件，在编译的同时建立工程,打开 "settings->link" *在link项的Object/library modules:中加入Opengl32.lib glu32.lib glaux.lib(Container packing problem: given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber* long are L, but the radius is different for the first i-kan timber radius ri. Asked how the packing, making me be assembled in* the maximum utilization of space? Use greedy algorithm to solve.* Compiler Methods: Open cpp file, compiled at the same time in the establishment of the project, open the settings-)

酒精测试仪proteus仿真，单片机进行分析处理，判断是否醉酒驾车，再通过液晶板显示出来。(Alcohol Tester proteus simulation, analysis and processing microcontroller to determine whether drunk driving, and then through the LCD panel display.)

线性规划问题，用两阶段法求解。输入输出的类型均为有理数，每个有理数用两个长整形表示。(Linear programming problem, using a two-stage method to solve. The type of input and output are rational, every rational number indicated by two long plastic surgery.)

说明：  此程序用于统计字符串种字符数字以及其他自负的个数。可用对话框输入显示。(procedure for statistical character string types, and other figures of the number conceited. Input dialog box shows available.)

在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)

opengl编写的小球碰撞会变色，碰撞是弹性碰撞。(The small ball collision written by OpenGL will change color, and the collision is an elastic collision.)

说明：  基于VC++的一个标尺小程序，程序用的是vs2010(A ruler program based on VC++, which uses VS2010)

是3d_rma数据库读写的程序，原来随数据库附带的读数据的程序读出的点有误，在此基础上做了一些修改，可以正确的读出。(3d_rma database is read-write procedure, the original database with the data attached to the procedure time to read out the points to be wrong, on this basis to do some modifications, you can read out the correct.)

能够成功的实现走马灯功能，使LED循环亮灭(To succeed the implementation of the version function, make the LED circular light out)

航线问题的解决，这个航线问题是c++学习中必须掌握的算法问题里的最为常见的算法问题，从而解决最短距离算法。( Solve these problems, this route issue is c++ learning algorithm must master the most common problems in algorithmic problems, so as to solve the shortest distance algorithm.)