期刊文献+

散乱数据点云边界特征自动提取算法 被引量:50

Automatic extraction of boundary characteristic from scatter data
下载PDF
导出
摘要 提出一种散乱数据点云边界特征自动提取算法,该算法采用R*-tree动态空间索引结构组织散乱数据点云的拓扑关系,基于该结构获取采样点的k近邻点作为局部型面参考数据,以最小二乘法拟合该数据的微切平面,并将其向微切平面投影,根据采样点与其k近邻所对应投影点连线的最大夹角识别散乱点云边界特征.实例验证该算法可快速、准确地提取散乱数据点云的边界特征. A new automatic extraction algorithm of scatter data boundary characteristic was proposed. The topology of scattered points was constructed using R^* -tree dynamic spacial index structure. The k neighbors of the sampling point was obtained as local model surface reference data based on the dynamic spacial index structure and the local model surface reference data was projected to the tangency plane fitted by using least squares method. The boundary characteristic of scatter data could be extracted according to the maximum angle between the connections of the projections of the sampling point and its k neighbors. The accurately and availably extraction of scatter data boundary characteristic was proved by the application examples.
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第8期82-84,共3页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家高技术研究发展计划资助项目(2006AA04Z105)
关键词 曲面重构 边界特征 微切平面 散乱数据点云 R*-tree动态空间存取模型 surface reconstruction boundary characteristic extraction tiny tangency plane scatter data R* -tree dynamic spatial access model
  • 相关文献

参考文献8

二级参考文献30

  • 1张曙.先进制造技术讲座——第二讲 快速产品开发技术(上)[J].机电一体化,1996,2(5):34-37. 被引量:4
  • 2李江雄.复杂曲面反求工程CAD建模技术研究[M].杭州:浙江大学,1998..
  • 3刘之生.反求工程技术[M].北京:机械工业出版社,1996..
  • 4[1]Guttman A. R-trees: a dynamic index structure for spatial searching [A]. ACM SIGMOD [C]. Waterloo, Ontario, Canada: [s.n.], 1984, 13(2): 47~57.
  • 5[2]Samet H. The design and analysis of spatial data structures [M]. Reading, MA: Addison-Wesley, 1990. 130~153.
  • 6[3]Friedman J H, Bentley J L, Finkel R A. An algorithm for finding the best matches in logarithmic expected time [J]. ACM Trans Math Software, 1977, 3(3): 209~226.
  • 7[4]Sproull R F. Refinements to nearest neighbor searching in k-dimensional trees [J]. Algorithmic, 1991, 15(6):579~599.
  • 8[5]Rousspoulos N, Kelly S, Vincent F. Nearest neighbor queries [A]. In Proceedings of the ACM SIGMOD International Conference on the Management of Data [C]. San Jose, CA, USA: [s.n.], 1995, 24(2): 71~79.
  • 9[6]Hjaltason G R, Samet H. Distance browsing in spatial databases [J]. ACM Transaction on Database Systems, 1999, 24(2):265~318.
  • 10Madabhushi A, Metaxas D. Automatic boundary extraction of ultrasonic breast lesions. In:Mercer B ed. Biomedical Imaging, 2002 IEEE International Symposium on, Washington, 2002, Washington:Omni Press, 2002:601~604

共引文献149

同被引文献390

引证文献50

二级引证文献197

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部