@inproceedings{Ortega:1993:FDP:169627.169820,
title = {Fast Data Parallel Polygon Rendering},
author = {Frank Ortega and Charles Hansen and James Ahrens},
url = {https://datascience.dsscale.org/wp-content/uploads/sites/3/2016/06/FastDataParellelPolygonRendering.pdf
http://doi.acm.org/10.1145/169627.169820},
doi = {10.1145/169627.169820},
isbn = {0-8186-4340-4},
year = {1993},
date = {1993-01-01},
booktitle = {Proceedings of the 1993 ACM/IEEE Conference on Supercomputing},
pages = {709--718},
publisher = {ACM},
address = {Portland, Oregon, USA},
series = {Supercomputing '93},
abstract = {This paper describes a parallel method for polygonal rendering ona massively pamliel SIMD machine. This method, hazed on a simple shading model, is taqeted for applications which require very fad polygon rendering for extremely large sets of polygons such as is found in many scientific visualization applications, The algorithms described in this paper are incorpomted into a library of 9D gmphics routines written for the Connection Machine. The routines am implemented on both the CM-ZOO and the CM-5. This libmry enables a acientid to display $D shaded polygons directly jhm a pamllel machine without the need to tmnamit huge amounts of data to a pod-processing rendering system.},
note = {LA-UR-93-3173},
keywords = {data-parallel, polygon rendering},
pubstate = {published},
tppubtype = {inproceedings}
}