Research on moving patched grid pre-processing technology
LU Lin-sheng · Jisuanji gongcheng yu sheji · 2009
To improve the efficiency of paralle solution to moving patched, a method is discussed.It includes reducing the research bound by getting the intersection region of two surfaces, building the Kd tree based on girds of patched surfaces, setting the index of smaller surfaces.Experiments'results show that the above method can reduce computing-time.