Concurrent Binary Trees for Large-Scale Game Components
Article No.: 31, Pages 1 - 18
Abstract
A concurrent binary tree (CBT) is a GPU-friendly data-structure suitable for the generation of bisection based terrain tessellations, i.e., adaptive triangulations over square domains. In this paper, we expand the benefits of this data-structure in two respects. First, we show how to bring bisection based tessellations to arbitrary polygon meshes rather than just squares. Our approach consists of mapping a triangular subdivision primitive, which we refer to as a bisector, to each halfedge of the input mesh. These bisectors can then be subdivided adaptively to produce conforming triangulations solely based on halfedge operators. Second, we alleviate a limitation that restricted the triangulations to low subdivision levels. We do so by using the CBT as a memory pool manager rather than an implicit encoding of the triangulation as done originally. By using a CBT in this way, we concurrently allocate and/or release bisectors during adaptive subdivision using shared GPU memory. We demonstrate the benefits of our improvements by rendering planetary scale geometry out of very coarse meshes. Performance-wise, our triangulation method evaluates in less than 0.2ms on console-level hardware.
References
[1]
Arul Asirvatham and Hugues Hoppe. 2005. Terrain rendering using GPU-based geometry clipmaps. GPU Gems 2 (2005), 27--46.
[2]
F Betul Atalay and David M Mount. 2007. Pointerless implementation of hierarchical simplicial meshes and efficient neighbor finding in arbitrary dimensions. International Journal of Computational Geometry & Applications 17, 06 (2007), 595--631.
[3]
Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, and Bruno Lévy. 2010. Polygon Mesh Processing. AK Peters / CRC Press. 250 pages. https://hal.inria.fr/inria-00538098
[4]
Eric Bruneton and Fabrice Neyret. 2008. Precomputed Atmospheric Scattering. In Proceedings of the Nineteenth Eurographics Conference on Rendering (Sarajevo, Bosnia and Herzegovina) (EGSR '08). Eurographics Association, Goslar, DEU, 1079--1086. https://doi.org/10.1111/j.1467-8659.2008.01245.x
[5]
Christopher A. Burns and Warren A. Hunt. 2013. The Visibility Buffer: A Cache-Friendly Approach to Deferred Shading. Journal of Computer Graphics Techniques (JCGT) 2, 2 (12 August 2013), 55--69. http://jcgt.org/published/0002/02/04/
[6]
Swen Campagna, Leif Kobbelt, and Hans-Peter Seidel. 1998. Directed Edges-A Scalable Representation for Triangle Meshes. Journal of Graphics Tools 3, 4 (1998), 1--11. https://doi.org/10.1080/10867651.1998.10487494
[7]
Thomas Deliot, Xiaoling Yao, Jonathan Dupuy, and Kees Rijnen. 2021. Experimenting With Concurrent Binary Trees for Large-scale Terrain Rendering. In ACM SIGGRAPH 2021 Courses. https://advances.realtimerendering.com/s2021/index.html
[8]
Mark Duchaineau, Murray Wolinsky, David E Sigeti, Mark C Miller, Charles Aldrich, and Mark B Mineev-Weinstein. 1997. ROAMing terrain: real-time optimally adapting meshes. In Proceedings. Visualization'97 (Cat. No. 97CB36155). IEEE, 81--88.
[9]
Jonathan Dupuy. 2020. Concurrent Binary Trees (with Application to Longest Edge Bisection). Proc. ACM Comput. Graph. Interact. Tech. (2020). https://doi.org/10.1145/3406186
[10]
J. Dupuy and K. Vanhoey. 2021. A Halfedge Refinement Rule for Parallel Catmull-Clark Subdivision. Computer Graphics Forum (2021). https://doi.org/10.1111/cgf.14381
[11]
Epic. 2023. Water Meshing System and Surface Rendering in Unreal Engine 5. https://docs.unrealengine.com/5.0/en-US/water-meshing-system-and-surface-rendering-in-unreal-engine/
[12]
Stephan Etienne. 2023. ELarge-Scale Terrain Rendering in Call of Duty. In ACM SIGGRAPH 2021 Courses. https://advances.realtimerendering.com/s2023/index.html#CODTerrain
[13]
William Evans, David Kirkpatrick, and Gregg Townsend. 2001. Right-triangulated irregular networks. Algorithmica 30, 2 (2001), 264--286.
[14]
Damien Hinsinger, Fabrice Neyret, and Marie-Paule Cani. 2002. Interactive Animation of Ocean Waves. In Proceedings of the 2002 ACM SIGGRAPH/Eurographics Symposium on Computer Animation (San Antonio, Texas) (SCA '02). Association for Computing Machinery, New York, NY, USA, 161--166. https://doi.org/10.1145/545261.545288
[15]
Lok M Hwa, Mark A Duchaineau, and Kenneth I Joy. 2004. Adaptive 4-8 texture hierarchies. In IEEE Visualization 2004. IEEE, 219--226.
[16]
Brian Karis, Rune Stubbe, and Graham Wihlidal. 2021. A deep dive into Nanite virtualized geometry. In ACM SIGGRAPH 2021 Courses. https://advances.realtimerendering.com/s2021/index.html
[17]
Lutz Kettner. 1999. Using generic programming for designing a data structure for polyhedral surfaces. Computational Geometry 13, 1 (1999), 65 - 90. https://doi.org/10.1016/S0925-7721(99)00007-3
[18]
Peter Lindstrom, David Koller, William Ribarsky, Larry F Hodges, Nick L Faust, and Gregory Turner. 1996. Real-time, continuous level of detail rendering of height fields. Technical Report. Georgia Institute of Technology.
[19]
Peter Lindstrom and Valerio Pascucci. 2002. Terrain simplification simplified: A general framework for view-dependent out-of-core visualization. IEEE Transactions on Visualization and Computer graphics 8, 3 (2002), 239--254.
[20]
Frank Losasso and Hugues Hoppe. 2004. Geometry Clipmaps: Terrain Rendering Using Nested Regular Grids. ACM Trans. Graph. 23, 3 (aug 2004), 769--776. https://doi.org/10.1145/1015706.1015799
[21]
Joseph M Maubach. 1995. Local bisection refinement for n-simplicial grids generated by reflection. SIAM Journal on Scientific Computing 16, 1 (1995), 210--227.
[22]
William F Mitchell. 2016. 30 years of newest vertex bisection. In AIP Conference Proceedings, Vol. 1738. AIP Publishing.
[23]
Can Özturan. 1996. Worst Case Complexity of Parallel Triangular Mesh Refinement by Longest Edge Bisection. Technical Report. Institute for Computer Applications in Science and Engineering.
[24]
M Cecilia Rivara. 1984. Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. International journal for numerical methods in Engineering 20, 4 (1984), 745--756.
[25]
Jerry Tessendorf et al. 2001. Simulating ocean water. SIGGRAPH Course notes (2001), 5.
[26]
Luiz Velho. 2000. Semi-regular 4-8 refinement and box spline surfaces. In Proceedings 13th Brazilian Symposium on Computer Graphics and Image Processing (Cat. No. PR00878). IEEE, 131--138.
[27]
Luiz Velho and Denis Zorin. 2001. 4--8 Subdivision. Computer Aided Geometric Design 18, 5 (2001), 397--427.
[28]
K. Weiler. 1985. Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments. IEEE Computer Graphics and Applications 5, 1 (1985), 21--40. https://doi.org/10.1109/MCG.1985.276271
[29]
Kenneth Weiss. 2011. Diamond-based models for scientific visualization. Ph.D. Dissertation.
[30]
Kenneth Weiss and Leila De Floriani.2011. Simplex and diamond hierarchies: Models and applications. In Computer Graphics Forum, Vol. 30. Wiley Online Library, 2127--2155.
[31]
M Adil Yalçın, Kenneth Weiss, and Leila De Floriani. 2011. GPU algorithms for diamond-based multiresolution terrain processing. In Eurographics Symposium on Parallel Graphics and Visualization. 10--11.
Index Terms
- Concurrent Binary Trees for Large-Scale Game Components
Recommendations
Parallel smoothing of quad meshes
Special Issue SMI'2008For use in real-time applications, we present a fast algorithm for converting a quad mesh to a smooth, piecewise polynomial surface on the Graphics Processing Unit (GPU). The surface has well-defined normals everywhere and closely mimics the shape of ...
A Feature-adaptive Subdivision Method for Real-time 3D Reconstruction of Repeated Topology Surfaces
It's well known that rendering for a large number of triangles with GPU hardware tessellation has made great progress. However, due to the fixed nature of GPU pipeline, many off-line methods that perform well can not meet the on-line requirements. In ...
TetFusion: an algorithm for rapid tetrahedral mesh simplification
VIS '02: Proceedings of the conference on Visualization '02This paper introduces an algorithm for rapid progressive simplification of tetrahedral meshes: TetFusion. We describe how a simple geometry decimation operation steers a rapid and controlled progressive simplification of tetrahedral meshes, while also ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 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 the author(s) 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].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 August 2024
Published in PACMCGIT Volume 7, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 112Total Downloads
- Downloads (Last 12 months)112
- Downloads (Last 6 weeks)61
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
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.
Sign in