Parallel Reduction Algorithm for Massive Meshes

摘要：

The meshes with tens of millions of polygons are too complex to fit in main memory, so it is very hard for sequential algorithm to process them. We present a parallel reduction method for large polygonal meshes. The algorithm partitions the original model firstly, sends each portion to a slave processor,simplifies them concurrently, and merges them together lastly.We give an efficient method to deal with the problem of partition border and portion merging. With parallel implementation, the algorithm can handle extremely large data set, and speed up the execution time. Experiment shows that our algorithm can produce approximations of high quality.

关键词： parallel reduction edge collapse, massive mesh

作者: TANG Xinting SONG Lihua ZHANG Lifeng

作者单位: Department of Computer Science and Technology LuDong University Yantai, Shandong Province, China

会议类型: 国际会议

会议名称: 第二届国际计算机新科技与教育学术会议(Proceedings of the Second International Conference on Computer Science & Education ICCSE2007)

会议地点: 武汉

会议语种:英文

页码: 338-341

在线出版日期: 2007-07-25（万方平台首次上网日期，不代表论文的发表时间）