Article

Geometry engine optimization: cache friendly compressed representation of geometry

Authors:

Jatin Chhugani,

Subodh KumarAuthors Info & Claims

I3D '07: Proceedings of the 2007 symposium on Interactive 3D graphics and games

Pages 9 - 16

https://doi.org/10.1145/1230100.1230102

Published: 30 April 2007 Publication History

Abstract

Recent advances in graphics architecture focus on improving texture performance and pixel processing. These have paralleled advances in rich pixel shading algorithms for realistic images. However, applications that require significantly more geometry processing than pixel processing suffer due to limited resource being devoted to the geometry processing part of the graphics pipeline. We present an algorithm to improve the effective geometry processing performance without adding significant hardware. This algorithm computes a representation for geometry that reduces the bandwidth required to transmit it to the graphics subsystem. It also reduces the total geometry processing requirement by increasing the effectiveness of the vertex cache. A goal of this algorithm is to keep the primitive assembly simple for easy hardware implementation.

References

[1]

Alliez, P., and Desbrun, M. 2001. Progressive compression for lossless transmission of triangle meshes. In Proc. ACM SIGGRAPH, ACM, 195--202.

Digital Library

[2]

Bar-Yehuda, R., and Gotsman, C. 1996. Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics 15, 2, 141--152.

Digital Library

[3]

Bogomjakov, A., and Gotsman, C. 2001. Universal rendering sequences for transparent vertex caching of progressive meshes. In Proc. Graphics Interface, ACM, 81--90.

Digital Library

[4]

Chow, M. M. 1997. Optimized geometry compression for real-time rendering. In Proc. IEEE Visualization, IEEE, 347--354.

Digital Library

[5]

Cover, T. M., and Joy, A. T. 1991. Elements of Information. John Wiley and Sons.

[6]

Deering, M. F. 1995. Geometry compression. In Proc. ACM SIGGRAPH, ACM, 13--20.

Digital Library

[7]

Diaz-Gutierrez, P., Bhushan, A., Gopi, M., and Pajarola, R. 2006. Single-strips for fast interactive rendering. Visual Computer 22, 6 (June), 372--386.

Digital Library

[8]

Estkowski, R., Mitchell, J. S. B., and Xiang, X. 2002. Optimal decomposition of polygonal models into triangle strips. In Proc. Symposium on Computational Geometry, ACM, 254--263.

Digital Library

[9]

Evans, F., Skiena, S. S., and Varshney, A. 1996. Optimizing triangle strips for fast rendering. In Proc. IEEE Visualization, IEEE, 319--326.

Digital Library

[10]

Gandoin, P. M., and Devillers, O. 2002. Progressive lossless compression of arbitrary simplicial complexes. In Proc. ACM SIGGRAPH, ACM, 372--379.

Digital Library

[11]

Gueziec, A. P., Bossen, F., Taubin, G., and Silva, C. 1999. Efficient compression of non-manifold meshes. In Proc. IEEE Visualization, IEEE, 73--80.

Digital Library

[12]

Gumhold, S., and Strasser, W. 1998. Real time compression of triangle meshes. In Computer Graphics, IEEE, 133--140.

Digital Library

[13]

Hoppe, H. 1999. Optimization of mesh locality for transparent vertex caching. In Proc. ACM SIGGRAPH, ACM, 269--276.

Digital Library

[14]

IdSoftware, 2005. http://www.idsoftware.com.

[15]

Isenburg, M. 2001. Triangle strip compression. Computer Graphics Forum 20, 2, 91--101.

[16]

Kronrod, B., and Gotsman, C. 2002. Optimized compression of triangle mesh geometry using prediction trees. In Proceedings of 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT-02), IEEE, 602--608.

[17]

Lin, G., and Yu, T. P. Y. 2006. An improved vertex caching scheme for 3d mesh rendering. IEEE Transactions on Visualization and Computer Graphics 12, 4, 640--648.

Digital Library

[18]

Nvidia, 2001. D3d optimization: http://developer.nvidia.com/attach/6523.

[19]

Nvidia, 2004. Triangle strip library:developer.nvidia.com/object/nvtristrip_library.html.

[20]

Purnomo, B., Bilodeau, J., Cohen, J. D., and Kumar, S. 2005. Hardware-compatible vertex compression using quantization and simplification. ACM SIGGRAPH/Eurographics Symposium on Graphics Hardware 2005.

Digital Library

[21]

Rossignac, J. 1999. Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics 5, 1, 47--61.

Digital Library

[22]

Szymczak, A., King, D., and Rossignac, J. 2001. An edgebreaker-based efficient compression scheme for regular meshes. Comput. Geom. Theory Appl. 20, 1--2, 53--68.

Digital Library

[23]

Taubin, G., and Rossignac, J. 1998. Geometric compression through topological surgery. ACM Transactions on Graphics 17, 2, 84--115.

Digital Library

[24]

Touma, C., and Gotsman, C. 1998. Triangle mesh compression. In Proc. Graphics Interface, ACM, 26--34.

[25]

Xiang, X., Held, M., and Mitchell, J. S. B. 1999. Fast and effective stripification of polygonal surface models. In Proceedings of the 1999 symposium on Interactive 3D graphics, ACM Press, ACM, 71--78.

Digital Library

[26]

Yoon, S.-E., and Lindstorm, P. 2006. Mesh layouts for block-based caches. IEEE Transactions on Visualization and Computer Graphics 12, 5, 47--61.

Digital Library

[27]

Yoon, S.-E., Lindstrom, P., Pascucci, V., and Manocha, D. 2005. Cache-oblivious mesh layouts. ACM Trans. Graph. 24, 3, 886--893.

Digital Library

Cited By

Mlakar DSteinberger MSchmalstieg D(2024)End‐to‐End Compressed Meshlet RenderingComputer Graphics Forum10.1111/cgf.1500243:1Online publication date: 24-Jan-2024
https://doi.org/10.1111/cgf.15002
Kenzel MKerbl BTatzgern WIvanchenko ESchmalstieg DSteinberger M(2018)On-the-fly Vertex Reuse for Massively-Parallel Software Geometry ProcessingProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333031:2(1-17)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233303
Kerbl BKenzel MIvanchenko ESchmalstieg DSteinberger M(2018)Revisiting The Vertex CacheProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333021:2(1-16)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233302
Show More Cited By

Index Terms

Geometry engine optimization: cache friendly compressed representation of geometry
1. Computing methodologies
  1. Computer graphics
    1. Graphics systems and interfaces
      1. Graphics processors
2. Information systems
  1. Data management systems
    1. Data structures
      1. Data layout
        Data compression

Recommendations

The ray engine
HWWS '02: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware

Assisted by recent advances in programmable graphics hardware, fast rasterization-based techniques have made significant progress in photorealistic rendering, but still only render a subset of the effects possible with ray tracing. We are closing this ...
Geometry-shader-based real-time voxelization and applications

This work proposes a new voxelization algorithm based on newly available GPU functionalities and designs several real-time applications to render complex lighting effects with the voxelization result. The voxelization algorithm can efficiently transform ...
A fast relighting engine for interactive cinematic lighting design
SIGGRAPH '00: Proceedings of the 27th annual conference on Computer graphics and interactive techniques

We present new techniques for interactive cinematic lighting design of complex scenes that use procedural shaders. Deep-framebuffers are used to store the geometric and optical information of the visible surfaces of an image. The geometric information ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

I3D '07: Proceedings of the 2007 symposium on Interactive 3D graphics and games

April 2007

196 pages

ISBN:9781595936288

DOI:10.1145/1230100

General Chairs:
Bruce Gooch
Northwestern University
,
Peter-Pike Sloan
Microsoft
,
Program Chairs:
Jonathan Cohen
Lawrence Livermore National Laboratory
,
Greg Turk
Georgia Institute of Technology
,
Ben Watson
North Carolina State University

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 April 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

I3D07

Sponsor:

SIGGRAPH

I3D07: Symposium on Interactive 3D Graphics and Games 2007

April 30 - May 2, 2007

Washington, Seattle

Acceptance Rates

Overall Acceptance Rate 148 of 485 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
559
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mlakar DSteinberger MSchmalstieg D(2024)End‐to‐End Compressed Meshlet RenderingComputer Graphics Forum10.1111/cgf.1500243:1Online publication date: 24-Jan-2024
https://doi.org/10.1111/cgf.15002
Kenzel MKerbl BTatzgern WIvanchenko ESchmalstieg DSteinberger M(2018)On-the-fly Vertex Reuse for Massively-Parallel Software Geometry ProcessingProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333031:2(1-17)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233303
Kerbl BKenzel MIvanchenko ESchmalstieg DSteinberger M(2018)Revisiting The Vertex CacheProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32333021:2(1-16)Online publication date: 24-Aug-2018
https://dl.acm.org/doi/10.1145/3233302
Kwan KXu XWan LWong TPang W(2018)Packing Vertex Data into Hardware-Decompressible TexturesIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2017.269518224:5(1705-1716)Online publication date: 1-May-2018
https://doi.org/10.1109/TVCG.2017.2695182
Rodríguez MGobbetti EMarton FTinti APosada JBrutzman DGraèanin DYoo BOyarzun D(2013)Compression-domain seamless multiresolution visualization of gigantic triangle meshes on mobile devicesProceedings of the 18th International Conference on 3D Web Technology10.1145/2466533.2466541(99-107)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2466533.2466541
Meyer QKeinert BSußner GStamminger M(2012)Data-Parallel Decompression of Triangle Mesh TopologyComputer Graphics Forum10.1111/j.1467-8659.2012.03221.x31:8(2541-2553)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1111/j.1467-8659.2012.03221.x
Ripolles OChover MRamos F(2011)Visualization of level-of-detail meshes on the GPUThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-011-0554-227:9(793-809)Online publication date: 1-Sep-2011
https://dl.acm.org/doi/10.1007/s00371-011-0554-2
Tchiboukdjian MDanjean VRaffin B(2010)Binary Mesh Partitioning for Cache-Efficient VisualizationIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2010.1916:5(815-828)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1109/TVCG.2010.19
Ripolles OChover MGumbau JRamos FPuig-Centelles A(2009)Rendering continuous level-of-detail meshes by Masking StripsGraphical Models10.1016/j.gmod.2009.05.00271:5(184-195)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1016/j.gmod.2009.05.002
Silpa BVemuri KPanda P(2009)Adaptive Partitioning of Vertex Shader for Low Power High Performance Geometry EngineProceedings of the 5th International Symposium on Advances in Visual Computing: Part I10.1007/978-3-642-10331-5_11(111-124)Online publication date: 26-Nov-2009
https://dl.acm.org/doi/10.1007/978-3-642-10331-5_11
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents