并行TIN生成算法, 基于DeWall算法理论实现，400000点在本人的T60上需40秒，当然不包括重合点处理时间。可能还有些问题，如发现请联系我，谢谢！-TIN parallel generation algorithm, based on the theory DeWall algorithm achieved 400,000 points in my T60 on the required 40 seconds, of course, does not include the coinc

计算不连续性界面 考虑分离情况 研究接触问题-Calculated discontinuity interface to consider the problem of the separation of the case studies contact

使用hadoop的mapreduce算法，前提是先要搭建一个hadoop云平台，该程序不难，为初学者的hadoop程序，对刚刚接触hadoop的同学会有帮助。-Using hadoop mapreduce algorithm, a parallel sorting algorithm, the premise is to set up a hadoop cloud platform, the program is easy, hadoop program for beginners, help

北京大学ACM试题全套以及相应的解答，非常详细对于联系ACM很有效-Peking University ACM questions and answers a full, highly detailed contact ACM for effective