teset polygon is overlap or not

"pictureRecreator"也是一个很适合java学习者的小游戏,这个游戏将一副大图打散成9张,然后任意挑选8张出来,让玩家通过键盘和鼠标来控制图片移动,最后将它复原.-"pictureRecreator" is a very suitable for learners of small java games, the game will be a big map separated into nine, and then a random selection of eight out, allowing the player through the keyboard and mouse to control mobile picture, it will finally recover.

一个有限元分析软件，在网上找到的，一起学习。-A finite element analysis software, find online, along with learning.

大一时写的一个成绩管理课设，写的不好，就看看而已-large write a performance based management courses, write well, only to see it

用VC++开发了一个数控加工的三维仿真程序，能有效仿真加工过程。-With VC++ Developed a three-dimensional simulation of NC machining process simulation can effectively process.

在U_Boot-1.1.6源代码基础上修改过的可以在hfrk的SMDK2410开发板上运行的U-Boot代码.-In U_Boot-1.1.6 source code based on the modified SMDK2410 in the hfrk development board running U-Boot code.

java统计当前在线数-few online

C++开发的推箱子游戏 1.类的划分 Cdraw类 绘画加载地图（包括围墙、人、箱子等等） Cman类 是否完成（过关） 即时更新地图 2.设计思想 从文件map.txt里读取地图信息，然后通过Cdraw类加载地图，通过keydown事件调用Cman里的重载函数updatemap， 单参数updateMap(UINT nChar)是用于更改当前小人以及箱子的坐标，记录下来后传给updateMap(int x1, int y1, int x2, int y2, int x3, int y3) 从而改变地图。-C development Tuixiangzi a game. Class division Cdraw painting category loaded maps (including the wall, boxes, etc.) if the class completed Cman (clearance) updated maps 2. Design ideas from the paper map.txt Lane read map information, then pass Cdraw Class Loading maps, Calling the incident through keydown Cman Lane updatemap of overloading functions, updateMap single parameter (UINT nChar) is used to change the current villains and the coordinates of the boxes, After record pass updateMap (int x1, y1 int, int x2, int y2, x3 int, int y3), thus changing map.

VIPer53设计的开关电源,SCH及PCB,效率56％,很想提高效率,但有点难度.希望大家讨论.-VIPer53 switching power supply design, SCH and PCB, the efficiency of 56 percent, wanted to improve efficiency, but it

HART协议编程例程，非常完整，定能加快研发进度。-HART protocol programming routines, very complete and will be able to speed up the R

迷宫是游益智游戏形式的复杂的分支通道通过，规划求解必须找到一条路线。 在第一个迷宫由程序创建的然后代码发现一条路线。