摘要
在已有的消隐算法中 ,所采用的数据结构复杂 ,占用的存储容量大、效率低 .提出了一种快速消隐被遮挡部分的算法 ,给出了视图的定义 ,利用视图的闭包矩形进行遮挡分析 ,缩小搜索消隐图素的范围 ,减少求交计算的次数 .对消隐图素进行消隐分析的同时 ,采用了闭包矩形的重叠性检验 。
An efficient algorithm is put forward which can remove the hidden lines. Firstly, the definition of the view is presented; then the hidden relations are obtained by using bound Rectangle. Therefore, the bound in which the hidden lines will be searched is reduced. As a result, the degree of calculating intersecting pairs is reduced. A kind of method acts on figure elements. The algorithm is efficient and reliable. Finally, an example is offered.
出处
《大庆石油学院学报》
CAS
北大核心
2000年第2期54-56,共3页
Journal of Daqing Petroleum Institute
