Real time compression of triangle mesh connectivity

Gumhold, Stefan; Straßer, Wolfgang

doi:10.1145/280814.280836

Cited by 245 publications

(202 citation statements)

References 7 publications

Supporting

Mentioning

198

Contrasting

Order By: Relevance

“…[1][2][3]), while the rest focus on connectivity (e.g. [4][5][6]). A few papers are dedicated to multi-resolution methods for progressive transmission (e.g.…”

Section: Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

Compression of soft-body animation sequences

Karni

Gotsman

2004

Computers & Graphics

193

170

View full text Add to dashboard Cite

We describe a compression scheme for the geometry component of 3D animation sequences. This scheme is based on the principle component analysis (PCA) method, which represents the animation sequence using a small number of basis functions. Second-order linear prediction coding (LPC) is applied to the PCA coefficients in order to further reduce the code size by exploiting the temporal coherence present in the sequence. Our results show that applying LPC to the PCA scheme results in significant performance improvements relative to other coding methods. The use of these codes will make animated 3D data more accessible for graphics and visualization applications. r

show abstract

“…[1][2][3]), while the rest focus on connectivity (e.g. [4][5][6]). A few papers are dedicated to multi-resolution methods for progressive transmission (e.g.…”

Section: Previous Workmentioning

confidence: 99%

“…Ibarria and Rossignac [12] advocated the use of space-time predictors to capture the correlations in both spaces. They propose to traverse the connectivity graph in a manner similar to [4] and [6], predicting a new vertex position based on its neighbors (already traversed) in the current and previous frames.…”

Section: Previous Workmentioning

confidence: 99%

Compression of soft-body animation sequences

Karni

Gotsman

2004

Computers & Graphics

193

170

View full text Add to dashboard Cite

show abstract

“…Several papers have been published that provide better alternatives than the approach of converting polyg-onal models to triangle strips [22,37,20,34]. For a good survey of such techniques, the interested reader should refer the survey by Rossignac [34].…”

Section: A Brief Survey Of Triangle Strips and Related Data-structuresmentioning

confidence: 99%

Efficiently computing and updating triangle strips for real-time rendering

El-Sana

Evans

Kalaiah

et al. 2000

Computer-Aided Design

View full text Add to dashboard Cite

Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generation of triangle strips as well as their variants. We present efficient algorithms for partitioning polygonal meshes into triangle strips. Triangle strips have traditionally used a buffer size of two vertices. In this paper we also study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips. View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, in a view-dependent framework the triangle mesh connectivity changes at every frame making it difficult to use triangle strips. In this paper we present a novel data-structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road-map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications.

show abstract

“…The advantages of constructing triangle strips are not restricted to a reduction in the number of vertex transformations during rendering, but they have been shown to be useful in efficient data structures for fast back-face culling, vertex caching [6,1], mesh simplification, compression [5,11,12,7,8], and generation of space-filling curves [4]. Most stripification algorithms use a greedy technique to incrementally grow the strips [3,11], possibly followed by local optimizations to increase the strip length [15,13].…”

Section: Introductionmentioning

confidence: 99%

Single Triangle Strip and Loop on Manifolds with Boundaries

Diaz-Gutierrez

Eppstein

Gopi

2006

2006 19th Brazilian Symposium on Computer Graphics and Image Processing

View full text Add to dashboard Cite

The single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in its dual graph. However, such a perfect matching is not guaranteed in the dual graph of triangulated manifolds with boundaries. In this paper, we present algorithms that suitably modify the results of the dual graph matching to generate a single strip loop on manifolds with boundaries. Further, the algorithm presented in [4] can produce only strip loops, but not linear strips. We present an algorithm that does topological surgery to construct linear strips, with user-specified start and end triangles, on manifolds with or without boundaries. The main contributions of this paper include graph algorithms to handle unmatched triangles, reduction of the number of Steiner vertices introduced to create strip loops, and finally a novel method to generate single linear strips with arbitrary start and end positions.

show abstract

Real time compression of triangle mesh connectivity

Cited by 245 publications

References 7 publications

Compression of soft-body animation sequences

Compression of soft-body animation sequences

Efficiently computing and updating triangle strips for real-time rendering

Single Triangle Strip and Loop on Manifolds with Boundaries

Contact Info

Product

Resources

About