基于 CSG+Brep 模式的高效可靠隐藏线消除算法  

An Efficient and Reliable Hidden Line Removing Algorithm Based on CSG+Brep

作　　者：唐良红[1] 满志强[1] 孙立镌[1] 

机构地区：[1]哈尔滨理工大学

出　　处：《哈尔滨理工大学学报》1998年第4期65-68,共4页Journal of Harbin University of Science and Technology

摘　　要：在物体空间中，采用Ｄｉｖｉｄｅ－ａｎｄ－Ｃｏｎｑｕｅｒ策略的隐藏线消除算法，利用ＣＳＧ＋Ｂｒｅｐ的拓扑相关性和增加相关体素遮挡判断提高隐藏线消除的速度，用射线法解决隐藏线消除的可靠性．该算法已在ＣＡＩＤ系统中实现，消隐结果准确．A hidden line removing algorithm based on Divide-and-Conquer strategy working in object space is presented,whose speed is improved with the topological relation of the CSG+Brep,and stability is achieved with the ray method It runs well in the CAID system

关 键 词：计算机图形学 隐藏线消除算法 CSG+Brep模式 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]