The DOI matches its OpenAlex record.
Optimizing triangle strips for fast rendering
Abstract
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. In this paper, we present new and efficient algorithms for constructing triangle strips from partially triangulated models, and experimental results showing these strips are 10--30% 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. 1 Introduction Interactive display rates are crucial to exploratory scientific visualization and virtual reality. The speed of high-performance rendering engines on triangular meshes in computer graphics can be bounde...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
View-dependent refinement of progressive meshes
Hoppe, H. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258843 · Cited by 843
Edgebreaker: connectivity compression for triangle meshes
Rossignac, J. (1999) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.764870 · Cited by 670
ROAMing terrain: Real-time Optimally Adapting Meshes
Duchaineau, M., Wolinsky, M., Sigeti, D. E., Miller, M. C., Aldrich, C., & Mineev-Weinstein, M. B. (2002) · Proceedings. Visualization '97 (Cat. No. 97CB36155) · doi:10.1109/visual.1997.663860 · Cited by 592
Terrain simplification simplified: a general framework for view-dependent out-of-core visualization
Lindstrom, P., & Pascucci, V. (2002) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2002.1021577 · Cited by 267
Metadata
- Authors
- Evans, F., Skiena, S., & Varshney, A.
- Published
- 1996-10-27
- Pages
- 319-326
- DOI
- 10.5555/244979.245626
- OpenAlex
- W2134859956
- Cited by
- 184
- References
- 0
- FWCI
- 16.26
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.