摘要
实现了任意平面和立方体网格相截,简捷地得到了截面和立方体网格的所有交点,在此基础上,提出了相关体元搜索算法,该算法能够快速地搜索出所有与截面相交的体元,减少了所有体元和截面进行求交判断的计算量.在科学计算可视化中得到很好地应用.
The intersection of an arbitrary plane and some cube network is realized. And all the points of intersection are got briefly. On the basis of this, a new algorithm of searching correlate cubes is presented. This algorithm can search out all the cubes which intersect the section accurately. It reduces the amount of calculation in judging whether the cubes intersect the section. This algorithm is used very well in visualization in scientific computing. [
出处
《沈阳工业学院学报》
CAS
1997年第4期35-39,共5页
Journal of Shenyang Institute of Technology
关键词
立方体网格
截面
相关体元
科学计算可视化
cube network, section, correlate cube, visualization in scientific computing.