首页 | 本学科首页   官方微博 | 高级检索  
     

曲面离散跟踪求交算法的研究
引用本文:许晓革,冀阳峰,杨蕾.曲面离散跟踪求交算法的研究[J].工程图学学报,2005,26(1):61-64.
作者姓名:许晓革  冀阳峰  杨蕾
作者单位:北京信息工程学院,北京,100101
摘    要:跟踪求交是参数曲面求交常用的算法,而对于离散化的曲面也可以采用类似的方法。笔者提出的离散化跟踪求交是用离散方法求出交线上的某一个交点,然后根据两相交小三角面片的空间几何关系确定该交线段的方向。依次用跟踪法求出整条交线,这样就有效地避免了用离散法求交线不连贯的问题。

关 键 词:计算机应用  跟踪求交  离散法  曲面  网格  包容盒
文章编号:1003-0158(2005)01-0061-04
修稿时间:2004年10月21

Research on Algorithm of Marching Method for Intersection
XU Xiao-ge,JI Yang-feng,Yang Lei.Research on Algorithm of Marching Method for Intersection[J].Journal of Engineering Graphics,2005,26(1):61-64.
Authors:XU Xiao-ge  JI Yang-feng  Yang Lei
Abstract:A marching method for intersection is a common using algorithm for solving intersection of parametric surfaces ,as well as that of discrete surfaces. The discrete marching method in the paper, get an intersection point by discrete method, and make sure the direction of intersection with the special geometrical position of two little inter-crossing triangle surfaces. Then the whole intersection can be obtained with marching method, which can effectively avoid the discontinuity of the intersection with discrete method.
Keywords:computer application  a marching method for intersection  discrete method  surface  grid  bounding box
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号