期刊文献+

运动曲面求交优化算法 被引量:2

Optimized Intersection Algorithm of Moving Parametric Surfaces
下载PDF
导出
摘要 运动曲面求交通常采用曲面求交算法 ,通过反复迭代求取曲面交线 ,没有考虑运动曲面自身的特性进行求交简化 由于运动曲面不同运动瞬间的曲面交线之间存在必然联系 ,因此通过对曲面内在属性分析 ,提出了运用运动曲面不同运动瞬间曲面交线相似性进行运动曲面求交的优化算法 首先对两个运动曲面的基曲面进行预处理 ,获取表征曲面交线拓扑的特征点 ;根据特征点分布图确定不同运动瞬间曲面交线起始点搜索策略 ,采用跟踪法动态调整步长和跟踪方向求解整个交线环 采用文中方法可以有效地解决运动曲面的子环、奇点遗漏、分支跳跃、乱序跟踪和初始点求取问题 ,精确、鲁棒。 Commonly, surface/surface intersection algorithm is used repeatedly to solve the intersection problem of a pair of moving surfaces When both surfaces are moving along a straight line, coherence exists in the successive sets of intersection curves, this fact can be utilized to accelerate the process of solution This paper proposes an optimized approach based on topology similarity First, it pre processes surfaces to achieve topology transition points (TTP) which indicate the topological features of intersection loops According to TTP graph, the initial point searching strategy and intersect curve topology can be fixed, and then all of the intersection loops can be calculated by tracing algorithm The algorithm can handle degenerate cases such as loop vanishing and singularity point vanishing, calculating the intersection loops robustly and effectively
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2003年第7期886-892,897,共8页 Journal of Computer-Aided Design & Computer Graphics
基金 国家教育部博士点基金 ( 2 0 0 0 0 3 3 5 5 4) 浙江省自然科学基金( 60 0 110 7)
关键词 运动曲面 曲面交线 特征点分布 拓扑结构 跟踪法 parallel moving parametric surfaces topology transition point
  • 相关文献

参考文献17

  • 1Chen Y, Ravani B. Offset surface generation and contouring in computer-aided design[J]. ASME Journal of Mechanisms, Transmissions, and Automation in Design, 1987, 109(1): 133~142
  • 2Farouki R T, Tsai Y F, Yuan G-F. Contour machining of free-form surfaces with real-time PH curve interpolators[J]. Computer Aided Geometric Design, 1999, 16(1): 61~76
  • 3Abdel-Malek K, Yeh H-J. On the determination of starting points for parametric surface intersections[J]. Computer-Aided Design, 1997, 29(1): 21~35
  • 4Chang L C, Bein W W, Angel E. Surface intersection using parallelism[J]. Computer Aided Geometric Design 1994,11(1): 39~69
  • 5Grandine T, Klein IV FW. A new approach to the surface intersection problem[J]. Computer-Aided Design, 1997, 14(2): 111~134
  • 6Ma Y, Lee YS. Detection of loops and singularities of surface intersections[J]. Computer-Aided Design, 1998, 30(14): 1059~1067
  • 7Mullenheim G. On determining start points for a surface/surface intersection algorithm[J]. Computer -Aided Design, 1991, 8(5): 401~408
  • 8Bajaj C L, Hoffman C M, Lynch R E, et al. Tracing surface intersections[J]. Computer Aided Geometric Design, 1988, 5(5): 285~307
  • 9Houghton E G, Emnet R F, Factor J D, et al. Implementation of a divide and conquer method for intersection of parametric surfaces[J]. Computer Aided Geometric Design, 1985, 2(11): 173~183
  • 10Koparkar P A, Mudur S P. Generation of continuous smooth curves resulting from operations on parametric surface patches[J]. Computer-Aided Design, 1986, 18(5): 193~206

二级参考文献2

  • 1Hu Chunyi,Computer Aided Design,1997年,29卷,9期,617页
  • 2Hu Chunyi,Computer Aided Design,1997年,29卷,9期,617页

共引文献11

同被引文献22

引证文献2

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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