An Algorithm for 3D Scan-Conversion of Polygons
Loading...
Date
1987
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Eurographics Association
Abstract
A three-dimensional (3D) scan-conversion algorithm, that scanconverts 3D planar polygons into their discrete voxel-map representation within a Cubic Frame Buffer (CFB), is presented. The algorithm, which is a variation of a 2D scan-line filling algorithm, is incremental and uses only simple operations like additions and testy inside the inner loops. The algorithm performs scan-conversion with computational complexity which is linear in the number of voxels written to the CFB. The paper also presents an algorithm that scan-converts polygons clipped to the CFB boundaries with no added time complexity. An all-integer decision mechanism which makes the inner-most loop of the algorithm more efficient is discussed too. All the algorithms guarantee lack of 6-connected "tunnels" in the converted polygons. The algorithms have been implemented as part of the 3D geometry processor of the CUBE Architecture, which is a voxel-based system for 3D graphics. These algorithms allow the' CUBE system to generate the essential primitive polygon within the CFB from a 3D geometric model.
Description
@inproceedings{10.2312:egtp.19871015,
booktitle = {EG 1987-Technical Papers},
editor = {},
title = {{An Algorithm for 3D Scan-Conversion of Polygons}},
author = {Kaufman, Arie},
year = {1987},
publisher = {Eurographics Association},
ISSN = {1017-4656},
ISBN = {},
DOI = {10.2312/egtp.19871015}
}