• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2006, Vol. 28 ›› Issue (9): 97-99.

• 论文 • 上一篇    下一篇

多个凹凸形多面体的深度优先消隐算法研究

袁超   

  • 出版日期:2006-09-01 发布日期:2010-05-20

  • Online:2006-09-01 Published:2010-05-20

摘要:

为了对多个凹凸形多面体进行消隐处理,应首先对单个凹凸形多面体进行可见性测试。对多个凹凸形多面体间可能出现的遮蔽进行屏幕投影多边形的重叠排除验证,对可能出 现重叠的多边形边进行交点计算、包容性测试和深度检查。本文指出,凹凸形多面体在可见性测试及投影多边形包容性测试方面应采用不同的处理方法。实践结果表明,此算
 算法可以取得较好的效果。

关键词: 多面体 深度优先 消隐算法 真实感图形

Abstract:

In order to perform hidden-surface processing on multiple concavo-convex polyhedrons, visible test should be made for a single concavo-convex polyhedr  on. As for the possible camouflage between multiple concavo-convex polyhedrons, we should give an overlap removal verification on screen projection polyhedrons;as for the possible overlapping between the edges of polygons, we carry out intersection point computation, containing test and depth inspection  . The article points out the concavo-convex polyhedron should    test. The practice indicates this algorithm may obtain a better effect

Key words: (polyhedron;depth first, hidden surface algorithm, realistic graph)