|
|
Acquisition algorithm for section data of scattered points based on R^* tree |
Sehool of Mechanical Engineering, Shandong University of Technology, Zibo, Shandong 255091, China) |
|
|
Abstract In order to obtain section data of scattered points rapidly and accurately, and to express the information of model with less data, an acquisition algorithm for section data was proposed. The section neighbor data was obtained based on the spacial index structure of scattered points, and its topology was organized with R^*- tree. The section neighbor data was divided into two parts based on the relation of section neighborhood data and location of cut plane. By the intersecting of matching points, the section data was obtained. The section data was sorted by the algorithm of minimum spanning tree. Finally, the ordered section data was obtained. The results show that the algorithm can obtain the section data accurately and effectively, has strong adaptability of data type, and can express the information of model with less data.
|
|
|
|
|
|
|
|