CuRast:基于CUDA的软件光栅化用于数十亿个三角形
CuRast: Cuda-Based Software Rasterization for Billions of Triangles
AI总结:
CuRast通过CUDA实现高效光栅化,可处理数十亿个三角形,比Vulkan快2-5倍(唯一)或12倍(实例化),但不支持透明和低多边形场景的高效处理。
摘要:
先前的研究表明,小三角形可通过计算着色器高效光栅化。基于此见解,我们探索如何在不预先构建加速结构的情况下,将此方法扩展至大规模三角形数据集。方法:三阶段光栅化管线首先在第一阶段直接光栅化小三角形,使用原子最小值存储最近的碎片。较大三角形转发至第二和第三阶段。结果:CuRast可将拥有数千万个三角形的模型渲染速度提升2-5倍(唯一)或12倍(实例化),但Vulkan在低多边形网格上仍快一个数量级。限制:目前专注于密集、不透明的网格,通常来自光谱摄影/3D重建。不支持混合/透明,且未高效实现成千上万的低多边形网格场景。未来工作:为适配游戏和更广泛的应用,需(1)优化处理数万节点/网格的场景;(2)添加支持层次聚类LOD如Meshoptimizer生成的;(3)添加透明支持,可能在单独阶段实现以保持不透明光栅化的高效和快速。源代码:https://github.com/m-schuetz/CuRast
英文摘要:
Previous work shows that small triangles can be rasterized efficiently with compute shaders. Building on this insight, we explore how far this can be pushed for massive triangle datasets without the need to construct acceleration structures in advance. Method: A 3-stage rasterization pipeline first rasterizes small triangles directly in stage 1, using atomicMin to store the closest fragments. Larger triangles are forwarded to stages 2 and 3. Results: CuRast can render models with hundreds of millions of triangles up to 2-5x (unique) or up to 12x (instanced) faster than Vulkan. Vulkan remains an order of magnitude faster for low-poly meshes. Limitations: We currently focus on dense, opaque meshes that you would typically obtain from photogrammetry/3D reconstruction. Blending/Transparency is not yet supported, and scenes with thousands of low-poly meshes are not implemented efficiently. Future Work: To make it suitable for games and a wider range of use cases, future work will need to (1) optimize handling of scenes with tens of thousands of nodes/meshes, (2) add support for hierarchical clustered LODs such as those produced by Meshoptimizer, (3) add support for transparency, likely in its own stage so as to keep opaque rasterization untouched and fast. Source Code: https://github.com/m-schuetz/CuRast
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。