Acquisition algorithm for section data of scattered points based on R*-tree

被引:0
|
作者
Sun D. [1 ]
Fan Z. [1 ]
Zhu C. [1 ]
Tian Z. [1 ]
机构
[1] School of Mechanical Engineering, Shandong University of Technology, Zibo
关键词
Acquisition of section data; Minimum spanning tree; R[!sup]*[!/sup]-tree; Scattered points; Section neighbor data;
D O I
10.3969/j.issn.1671-7775.2010.04.019
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:464 / 468
页数:4
相关论文
共 10 条
  • [1] Liu G.H., Wong Y.S., Zhang Y.F., Et al., Error-based segmentation of cloud data for direct rapid prototyping, Computer-Aided Design, 35, 7, pp. 633-645, (2003)
  • [2] Wu Y.F., Wong Y.S., Loh H.T., Et al., Modeling cloud data using an adaptive slicing approach, Computer-Aided Design, 36, 3, pp. 231-240, (2004)
  • [3] Liu Y., Ke Y., Slicing data processing and global optimization of feature curve in reverse engineering, Chinese Journal of Mechanical Engineering, 42, 3, pp. 124-129, (2006)
  • [4] Ke Y., Wang Q., Research on point cloud slicing technique in reverse engineering, Journal of Computer-Aided Design & Computer Graphics, 17, 8, pp. 1798-1802, (2005)
  • [5] Liu Y., Ke Y., Hybrid slicing technology in reverse engineering, Journal of Computer-Aided Design & Computer Graphics, 15, 6, pp. 741-745, (2003)
  • [6] Beckmann N., Kriegel H.P., Schneider R., Et al., R<sup>*</sup>-tree: An efficient and robust access method for points and rectangles, SIGMOD Record, 19, 2, pp. 322-331, (1990)
  • [7] Sun D., Fan Z., Li Y., Et al., Research and application of surface feature analysis for scatter data points, Chinese Journal of Mechanical Engineering, 43, 6, pp. 133-136, (2007)
  • [8] Zhu Q., Gong J., Zhang Y., An efficient 3D R-tree spatial index method for virtual geographic environments, ISPRS Journal of Photogrammertry and Remote Sensing, 62, 3, pp. 217-224, (2007)
  • [9] Brakatsoulas S., Pfoser D., Theodoridis Y., Revisiting R-tree construction principles, Proceedings of ADBIS2002, LNCS, 2435, pp. 149-162, (2002)
  • [10] Yang W., Liu J., Yu J., Et al., Distribution network optimal planning based on an improved prim algorithm, Transactions of China Electrotechnical Society, 20, 3, pp. 75-79, (2005)