A fast front-to-back hidden surface algorithm

被引：0

作者：

Silvetti, A ^{[1
]}

Delrieux, C ^{[1
]}

Castro, S ^{[1
]}

机构：

[1] Univ Nacl Sur, Dept Comp Sci, RA-8000 Bahia Blanca, Argentina

来源：

INTERNATIONAL CONFERENCE ON IMAGING SCIENCE, SYSTEMS, AND TECHNOLOGY, PROCEEDINGS | 1999年

关键词：

computer graphics; hidden surface removal; scan-line rendering;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A hidden-surface algorithm for polygonal scenes is presented. The algorithm performs in screen space, and can be embedded in standard (hardware or software) polygon scan-conversion with little effort. First, a sorting pass is applied to the faces. Then, the faces are rendered in. a front-to-back order. Our algorithm provides a considerable speedup with respect to other hidden-surface algorithms, especially when shading is applied. Cyclic overlap problems are avoided through a very fast and robust sorting technique that determines the geometrical priorities effaces in. 3D space.

引用

页码：203 / 209

页数：3