期刊文献+

基于法矢的散乱数据边界特征点自动提取算法 被引量:1

Algorithm for automatic extraction of boundary characteristic points from scatter data based on normal
下载PDF
导出
摘要 提出了一种基于翼边法矢的边界特征提取算法。在波前扩展算法中,采用了新的节点搜寻和波前更新方法,在波前扩展的同时计算波前边的两翼法矢夹角,根据网格边两翼法矢夹角识别出边界特征点。应用实例证明:该算法可行、有效,为复杂曲面特征曲线的构建奠定了基础。 An extraction algorithm of boundary characteristic point based on normal is proposed, in which novel node searching and front update methods are presented to advance front, the wing' s normal of front edges are computed during the extension of the front, and points of boundary characteristic are extracted according to the angle between normals of two wings of the mesh line. Then the proposed algorithm is proved to be feasible and valid by an application, which establishes the groundwork for the construction of feature lines about complex surface.
出处 《机械设计与制造》 北大核心 2006年第11期134-136,共3页 Machinery Design & Manufacture
基金 山东省自然科学基金资助项目(Y2004G10) 山东省教育厅科技项目资助(03D02)
关键词 散乱数据 波前扩展 法矢 边界特征提取 Scatter data Advancing front Normal Boundary characteristic extraction
  • 相关文献

参考文献10

  • 1Milroy M. J, Bradley C, Vickers G. W. Segmentation of a wrap - around model using an active contour [J]. Computer Aided Design, 1997, 29(4): 299 - 320.
  • 2Yang M, Lee E. Segmentation of measured point data using a parametric quadric surface approximation [J]. Computer Aided Design, 1999, 31 (7): 449-457.
  • 3胡鑫,习俊通,金烨.基于图像法的点云数据边界自动提取[J].上海交通大学学报,2002,36(8):1118-1120. 被引量:30
  • 4贺美芳,周来水,朱延娟.基于局部基面参数化的点云数据边界自动提取[J].机械科学与技术,2004,23(8):912-915. 被引量:20
  • 5Lohner R, Parlkh P. Generation of three dimensional unstructured grids by the advancing front method [J]. International Journal for Numerical Methods in Fluids, 1988, 8(10): 1135 - 1149.
  • 6Losh. Volume diseretization into tetrahedral I Verification and orientation of boundary surfaces [J]. Computers and Structures, 1991, 39 (5): 493 - 500.
  • 7J. Huang, C. H. Menq. Combinational manifold mesh reconstruc - tion and optimization from unorganized points with arbitrary technology [J]. Computer- Aided Design, 2002, 34(2): 149 - 165.
  • 8张苏,施法中.多裁剪自由曲面生成有限元网格的实现[J].软件学报,2005,16(11):2008-2013. 被引量:1
  • 9Norbert Beekmann, Hans - Peter begel, Ralf Schneider. The R - tree: An Efficient and Robust Access Method for Points and Rectangles + [J]. ACM, 1990: 322-331.
  • 10刘宇,朱仲英,施颂椒.空间k近邻查询的新策略[J].上海交通大学学报,2001,35(9):1298-1302. 被引量:17

二级参考文献32

  • 1张苏,施法中.多裁剪自由曲面的修补缝合功能的实现[J].计算机辅助设计与图形学学报,2005,17(4):699-703. 被引量:6
  • 2[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.
  • 3[2]Samet H. The design and analysis of spatial data structures [M]. Reading, MA: Addison-Wesley, 1990. 130~153.
  • 4[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.
  • 5[4]Sproull R F. Refinements to nearest neighbor searching in k-dimensional trees [J]. Algorithmic, 1991, 15(6):579~599.
  • 6[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.
  • 7[6]Hjaltason G R, Samet H. Distance browsing in spatial databases [J]. ACM Transaction on Database Systems, 1999, 24(2):265~318.
  • 8[3]Varady T,Martin R R,Cox J.Reverse engineering of geometric models-An introduction[J].Computer Aided Design,1997,29(4):255~268
  • 9[4]Milroy M J,Bradley C,Vickers G W.Segmentation of a wrap-around model using an active contour[J].Computer Aided Design,1997,29(4):299~320
  • 10[5]Alrashdan A,Moravalli S,Fallahi B.Automatic Segmentation of digitized data for reverse engineering applications[J].IIE Transaction,2000,32(1):59~69

共引文献57

同被引文献8

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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