Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Frank A. Ortega

dblp:71/1799 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Rendering · 87% Visualization and visual analytics · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering › parallel rendering
data-parallel rendering
0.011993
Fast data parallel polygon rendering · SC 1993
Rendering › surface rendering
polygon rendering
0.011993
Fast data parallel polygon rendering · SC 1993
Parallel and multicore computing
data parallelism
0.011993
Fast data parallel polygon rendering · SC 1993
Parallel and multicore computing
parallel programming models
0.011993
Fast data parallel polygon rendering · SC 1993
Visualization and visual analytics
scientific visualization
0.011993
Fast data parallel polygon rendering · SC 1993

Methods — techniques the papers use, named apart from their topics

shading model · 0.0load balancing · 0.0
YearPublicationVenuePosition
1993 Fast data parallel polygon rendering
abstract
This paper describes a data parallel method forpolygon rendering on a massively parallel machine. This method, based on a simple shading model, is targeted for applications which require very fast rendering for extremely large sets of polygons. Such sets are found in many scienti c visualization applications. The renderer can handle arbitrarily complex polygons which need notbe meshed. Issues involving load balancing are addressed andadataparallel load balancing algorithm is presented. The rendering and load balancing algorithms are implemented onboth the CM-200 and the CM-5. Experimental results are presented. This rendering toolkit enables a scientist to display 3D shaded polygons directly from aparallel machine avoiding the transmission of huge amounts of data to a post-processing rendering system. 1
Frank A. Ortega, Charles D. Hansen, James P. Ahrens
SC1