Virtual-Driving-Simulator

matlab c++ 联合编程简单示例，具体过程可以参照我的blog：http://blog.csdn.net/owldestiny/archive/2009/03/07/3966340.aspx(matlab c++ United programming easy example, the specific process can refer to my blog: http://blog.csdn.net/owldestiny/archive/2009/03/07/3966340.aspx)

matlab与CC++混合编程程序，可以参考下，适合初学者(matlab and C C++ mixed programming program, you can refer to, for beginners)

实现简单的记事本功能。如：打开文件，添加删除内容，字数统计与查找等功能。(Simple notepad. : Open the file, add and remove content, features such as word count and Find.)

此代码将leach和deec协议进行比较，对毕设要坐这方面的同学很有帮助，大家有兴趣可以看看。(This code will leach and deec protocol comparison, the complete set up to take the students very helpful in this regard, we are interested can look at.)

说明：  一个简单的画图程序，提供基本图元点、线、面，图元填充、裁剪的操作(Simple Draw)

说明：  gui file server client c++ tcp ip

说明：  DICOM 非专业人员教材,是学习DICOM的好东西。(DICOM teaching non-professionals is to learn good things DICOM.)

说明：  Jpeg算法源代码，包含jpeg的各种算法实现的vc++的源代码(Jpeg algorithm source code, including the various algorithms jpeg of vc++ source code)

《实战OpenGL三维可视化系统开发与源码精解》里的库文件，需要的拿走。(" Practically OpenGL visualization system development and source fine solution" where the library files needed away.)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)