An Algorithm for 3D Scan-Conversion of Polygons
| dc.contributor.author | Kaufman, Arie | en_US |
| dc.date.accessioned | 2015-10-05T07:55:24Z | |
| dc.date.available | 2015-10-05T07:55:24Z | |
| dc.date.issued | 1987 | en_US |
| dc.description.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. | en_US |
| dc.description.seriesinformation | EG 1987-Technical Papers | en_US |
| dc.identifier.doi | 10.2312/egtp.19871015 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egtp.19871015 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | An Algorithm for 3D Scan-Conversion of Polygons | en_US |