Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes

Bogomjakov, Alexander; Gotsman, Craig

doi:10.1111/1467-8659.00573

Cited by 72 publications

(33 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The strips obtained with our cache-size independent optimization method achieve cache-miss rates (number of vertex-cache misses divided by the number of triangles) near those obtained by [21], with the difference that we do not assume anything about the size of the vertex cache. We also observe that [5] indicates comparable results. For example, with a cache size of 32 vertices, while [5] reports an average cache miss ratio between 0.6 and 0.68 for various models, our algorithm exhibits a value between 0.66 and 0.7.…”

Section: Resultssupporting

confidence: 77%

“…We also observe that [5] indicates comparable results. For example, with a cache size of 32 vertices, while [5] reports an average cache miss ratio between 0.6 and 0.68 for various models, our algorithm exhibits a value between 0.66 and 0.7. Our results indicate that for commonly used cache sizes, a large percentage of vertices need to be fetched only once.…”

Section: Resultssupporting

confidence: 77%

“…Extending this concept, the efficient use of extra vertex registers has not only been exploited in geometry compression [9,6] for bandwidth reduction, but also for improved rendering [21,5,38]. In [21], multi-register vertex caching is used to increase the locality of vertex references, which reduces geometry transfer and transform costs significantly.…”

Section: Related Workmentioning

confidence: 99%

“…Similarly to our approach, [38] construct triangle strips that enhance the use of the vertex cache, regardless of its size. Further, [5,36] also explore the relationship between mesh locality and triangle strips.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Single-strips for fast interactive rendering

et al. 2006

View full text Add to dashboard Cite

Representing a triangulated two manifold using a single triangle strip is an NP-complete problem. By introducing a few Steiner vertices, recent works find such a single-strip, and hence a linear ordering of edge-connected triangles of the entire triangulation. In this paper, we extend previous results [10] that exploit this linear ordering in efficient triangle-strip management for high-performance rendering. We present new algorithms to generate single-strip representations that follow different user defined constraints or preferences in the form of edge weights. These functional constraints are application dependent; For example, normalbased constraints can be used for efficient rendering after visibility culling, or spatial constraints for highly coherent vertex-caching. We highlight the flexibility of this approach by generating single-strips with preferences as arbitrary as the orientation of the edges. We also present a hierarchical single-strip management strategy for high-performance interactive 3D rendering.

show abstract

Section: Resultssupporting

confidence: 77%

Section: Resultssupporting

confidence: 77%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Single-strips for fast interactive rendering

et al. 2006

View full text Add to dashboard Cite

show abstract

“…Several studies have been carried out that try to take advantage of this characteristic. These include Chow [2], who presents a method for the compression of geometry; Hoppe [6], who develops an algorithm for the generation of strips while taking advantage of the vertex cache in a transparent way; and Bogomjakov and Gotsman [1], who present a method for the optimization of the vertex cache applied to the Progressive Meshes [5] multiresolution model.…”

Section: General Solutionsmentioning

confidence: 99%

A Comparative Study of Acceleration Techniques for Geometric Visualization

Castelló

Ramos

Chover

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Nowadays computer graphics hardware presents a series of characteristics, such as AGP memory, vertex cache, etc., that can be used for real-time rendering. The aim of this paper is to conduct a comparative study of different techniques that are shown in the OpenGL graphics standard together with hardware features that enable the visualization of the geometry of complex objects to be accelerated. These techniques are applied to the multiresolution modeling, which requires techniques that can be implemented with dynamic geometry.

show abstract

Mobile 3D Graphics SoC

Woo¹,

Sohn²,

Nam³

et al. 2010

View full text Add to dashboard Cite

A 3D graphics pipeline has geometry operations for computing the attributes of vertices of polygons, and rendering operations for filling colors inside the polygons. The geometry stage generates vertex data from primitive input vertex attributes using transformation, lighting, and perspective projection. The rendering stage draws pixels from the vertex data computed in the geometry stage. First, vertex data are transformed into sets of 2D triangles using interpolation to calculate edge coordinates for each polygon. Then every pixel is rendered by shading and texture mapping. Alpha blending for translucent objects and depth comparison for hidden surface removal are performed during the rendering stage.The geometry operation is computation-intensive, and the rendering operation is data-intensive as well computation-intensive. To relieve bottlenecks, 3D graphics hardware has been evolving using fast, parallel datapaths such as multicore vector processors with 3D graphics-optimized memory systems [1,2].Mobile devices have limitations imposed by their power supply, their computational power, physical dimensions, and input devices. The fundamental problem is that mobile devices are powered by batteries.With regard to the hardware, the key issue to achieve good graphics performance and low power consumption is to reduce the internal data transactions between graphics-processing unit (GPU) and memory. Many researchers have focused on how to reduce or how to compress data transactions. As a result, various mobile graphics hardware approaches have been reported, including tile-based rendering [3], specialized embedded DRAM [4], and compression algorithms. They have employed various low-power techniques such as clock gating [5], power-down schemes, and voltage/ frequency scaling [5].With regard to the software, standard application programming interfaces (APIs) for embedded systems have been released: OpenGL-ES [6] and Microsoft Direct3D-Mobile [7]. The first is a subset of desktop OpenGL and adopts optimizations and Mobile 3D Graphics SoC: From Algorithm to Chip

show abstract

Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes

Cited by 72 publications

References 21 publications

Single-strips for fast interactive rendering

Single-strips for fast interactive rendering

A Comparative Study of Acceleration Techniques for Geometric Visualization

Mobile 3D Graphics SoC

Contact Info

Product

Resources

About