Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
A Visible Polygon Reconstruction Algorithm
ACM Transactions on Graphics (TOG)
Computer Graphics
Parallel Cell Projection Rendering of Adaptive Mesh Refinement Data
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
| Hi-index | 0.00 |
The algorithm presented for polygon scan conversion is very fast and can replace the standard version in any application. Special requirements from medical data sets illustrate its practicality and versatility. The polygon scan conversion problem refers to filling the interior of a region represented by one or more polygons. The polygons are represented by the coordinates of their vertices in cyclic order. This problem shows up in many areas of computer graphics. The standard approach to polygon scan conversion creates two data structures, an edge table and an active edge table (AET). The edge table contains a bucket for each scan line. Each bucket consists of a linked list containing all the edges starting on that scan line (or straddling it for the first time). Creation of the edge table is an image-space step, since it depends on the number of scan lines existing in image space (that is, on the resolution of the target display device). In this respect, it is a device-dependent step. The algorithm we develop uses only an object-space data structure instead of the edge table and is therefore less device dependent. In particular, it is suitable for both raster and vector graphics devices.