首页 | 官方网站   微博 | 高级检索  
     

基于画家算法的运动多面体的消隐方法
引用本文:吕旭东.基于画家算法的运动多面体的消隐方法[J].计算机辅助设计与图形学学报,1999,11(2):125-128.
作者姓名:吕旭东
作者单位:上海大学计算机科学系,上海,201800
摘    要:一般来说,画家算法(也称深度排序方法)适合于处理较为简单的多面体消隐问题。针对动态的复杂多面体,通过找出其在运动过程中的特点,提出了一种在画家算法的基础上减少重复排序,从而缩短运算时间的方法。在该方法提出之前,文中对其所基于的原理进行了证明。

关 键 词:消隐  画家算法  深度排序方法  运动多面体

A METHOD BASED ON PAINTER'S ALGORITHM FOR MOVING POLYHEDRONS' HIDDEN-SURFACE REMOVAL
LU Xu-Dong.A METHOD BASED ON PAINTER'S ALGORITHM FOR MOVING POLYHEDRONS' HIDDEN-SURFACE REMOVAL[J].Journal of Computer-Aided Design & Computer Graphics,1999,11(2):125-128.
Authors:LU Xu-Dong
Affiliation:LU Xu-Dong; (
Abstract:As a general rule , the Painter's Algorithm (i.e. the Depth Sorting Method) is most suitable to remove hidden surfaces of polyhedrons that have not too much surfaces and those have little overlap in depth. But for moving ones, we found out a method which is based on the Painter's Algorithm to improve the efficiency of the hidden surface removing process through eliminating repetitive sorts. Before the method is presented in this paper , several theorems that the former is based on are stated and proved.
Keywords:hidden  surface removal  painter's algorithm  depth  sorting method  moving polyhedron  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号