Parallel Polygon Rendering with Precomputed Surface Patches

Simple item page
dc.contributor.authorTheoharis, Theoharisen_US
dc.contributor.authorPage, Ianen_US
dc.date.accessioned2015-10-05T07:55:23Z
dc.date.available2015-10-05T07:55:23Z
dc.date.issued1987en_US
dc.description.abstractWe describe an algorithm for rendering a restricted class of trapeziums, and hence arbitrary polygons, in parallel on an NxN SIMD array processor. The algorithm achieves good performance by precomputing “surface patches” (finite portions of half -planes), thus trading storage for increased speed. The number of surface patches that are precomputed grows only linearly with the size of the array processor but as the square of the subpixel accuracy desired. NxN texture patterns can be added at very little extra cost additional to filling a trapezium with a particular colour.en_US
dc.description.seriesinformationEG 1987-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19871007en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19871007en_US
dc.publisherEurographics Associationen_US
dc.titleParallel Polygon Rendering with Precomputed Surface Patchesen_US
Files
Collections
EG1987 Proceedings (Technical Papers)
EG1987 Proceedings (Technical Papers)