Optimizing triangle strips for fast rendering

TitleOptimizing triangle strips for fast rendering
Publication TypeConference Papers
Year of Publication1996
AuthorsEvans F, Skiena S, Varshney A
Conference NameVisualization '96. Proceedings.
Date Published1996/11/27/1
Keywordsbuffer, data;triangulated, disciplines;rendering, model, models;polygonal, optimisation;triangulated, partitioning;queuing, rendering;graphics, sizes;fast, strip, subsystem;interactive, surfaces;data, times;scientific, triangulated, visualisation;, visualization;partially, visualization;triangle

Almost all scientific visualization involving surfaces is currently done via triangles. The speed at which such triangulated surfaces can be displayed is crucial to interactive visualization and is bounded by the rate at which triangulated data can be sent to the graphics subsystem for rendering. Partitioning polygonal models into triangle strips can significantly reduce rendering times over transmitting each triangle individually. We present new and efficient algorithms for constructing triangle strips from partially triangulated models, and experimental results showing these strips are on average 15% better than those from previous codes. Further, we study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips.