| 新包围盒技术 |
| |
| 引用本文： | 黄文钧,穆玉杰.新包围盒技术[J].广西民族大学学报,1998(1). |
| |
| 作者姓名： | 黄文钧 穆玉杰 |
| |
| 作者单位： | 广西民族学院数学与计算机科学系(黄文钧)，西北大学数学系(穆玉杰) |
| |
| 摘 要： | 通过只含减法运算的判断，将包围盒所含的平面片分成两种类型：一类是“显然和光线无交”，另一类是“可能和光线有交”．新包围盒技术包含两个算法：一个适用于光线跟踪技术，另一个适用于Ｇｏｕｒａｕｄ技术．
|
| 关 键 词： | 包围盒 求交 光线跟踪 算法 |
The Technique of New Covering-box |
| |
| Huang Wenjun.The Technique of New Covering-box[J].Journal of Guangxi University For Nationalities(Natural Science Edition),1998(1). |
| |
| Authors: | Huang Wenjun |
| |
| Abstract: | By subtracting operation, two groups planar patches are made from the planar patches in that covering box. Between the two groups,one consists of the planar patches which are clearly not pierced by the ray in that covering box and the other consists of the other planar patchs in that covering box. The technique contains two algorithms:one applies to Ray-tracing, the other applies to Gouraud technique. |
| |
| Keywords: | Covering box Intersecting Ray tracing Algorithm |
| 本文献已被 CNKI 等数据库收录！ |
