期刊文献+

DELAUNAY-BASED SURFACE RECONSTRUCTION ALGORITHM IN REVERSE ENGINEERING 被引量:2

DELAUNAY-BASED SURFACE RECONSTRUCTION ALGORITHM IN REVERSE ENGINEERING
在线阅读 下载PDF
导出
摘要 Triangulation of scattered points is the first important section duringreverse engineering. New concepts of dynamic circle and closed point are put forward based oncurrent basic method. These new concepts can narrow the extent which triangulation process shouldseek through and optimize the triangles during producing them. Updating the searching edgesdynamically controls progress of triangulation. Intersection judgment between new triangle andproduced triangles is changed into intersection judgment between new triangle and searching edges.Examples illustrate superiorities of this new algorithm. Triangulation of scattered points is the first important section duringreverse engineering. New concepts of dynamic circle and closed point are put forward based oncurrent basic method. These new concepts can narrow the extent which triangulation process shouldseek through and optimize the triangles during producing them. Updating the searching edgesdynamically controls progress of triangulation. Intersection judgment between new triangle andproduced triangles is changed into intersection judgment between new triangle and searching edges.Examples illustrate superiorities of this new algorithm.
出处 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2002年第3期238-242,共5页 中国机械工程学报(英文版)
关键词 Reverse engineering Delaunay triangulation Dynamic circle Closed point Reverse engineering Delaunay triangulation Dynamic circle Closed point
  • 相关文献

参考文献8

  • 1[1]Bidanda B, Hosni Y A. Reverse engineering and its relevance to industrial engineering:a critical review. Computers and Industrial Engineering, 1994, 26(2):343~384
  • 2[2]Tamas Varady, Ralph R Martin, Jordan Cox. Reverse engineering of geometric models-an introduction. Computer Aided Design, 1997, 29(4):255~268
  • 3[3]Lawson C L. Software for C ( surface interpolation. In:John R Rice ed. Mathematical Software III. Proceedings of mathematical software symposium. University of Wisconsin-Madison, 1977, London:Academic Press Inc, 1977:161~194
  • 4[4]Cline A K, Renka R L. Storage efficient method for construction of a Thiessen triangulation. Rocky Mountain Journal of Mathematics, 1984, 14(1):119~139
  • 5[5]Choi B K, Shin H Y, Yoon Y I, et al. Triangulation of scattered data in 3D space. Computer Aided Design, 1988, 20(8):239~248
  • 6[6]Fang T P, Piegl L A. Delaunay triangulation using a uniform grid. IEEE Computer Graphics and Application, 1993, 13(5):36~47
  • 7[7]Piegl L A, Richard Arnaud M. Algorithm and data structure for triangulating multiply connected polygonal domains. Computer and Graphics, 1993, 17(5):563~574
  • 8[8]Sloan S W. A fast algorithm for generating constrained Delaunay triangulations. Computers & Structures, 1993, 47(3):441~450

同被引文献2

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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