用自适应网格高效生成带细节的3D模型
GALA: Geometry-Aware Local Adaptive Grids for Detailed 3D Generation
- 基于树状结构仅覆盖物体表面,减少空域存储
- 局部坐标系随曲面形状调整,提升细节表现力
- 支持扩散模型生成,10秒内完成单个物体建模
我们提出GALA,一种新型3D形状表示方法,兼具高几何保真度、计算高效性,并适配现代扩散生成框架。核心思想是利用3D体中表面的全局稀疏性与局部表面特性:通过一组树根体素仅覆盖物体边界,每个体素内嵌八叉树以聚焦有表面区域;在非空叶节点中为每个局部区域拟合一个几何感知的坐标系,通过调整局部网格方向与轴向尺度以匹配表面形态,显著提升单位内存下的细节表达能力,实现无损量化。采用优化的C++/CUDA实现,可在10秒内完成单个物体的拟合。该表示可高效扁平化并由Transformer网络处理,我们构建了级联生成流程,能生成具有丰富几何细节的3D形状。
原文摘要 · Abstract (English)
We propose GALA, a novel representation of 3D shapes that (i) excels at capturing and reproducing complex geometry and surface details, (ii) is computationally efficient, and (iii) lends itself to 3D generative modelling with modern, diffusion-based schemes. The key idea of GALA is to exploit both the global sparsity of surfaces within a 3D volume and their local surface properties. Sparsity is promoted by covering only the 3D object boundaries, not empty space, with an ensemble of tree root voxels. Each voxel contains an octree to further limit storage and compute to regions that contain surfaces. Adaptivity is achieved by fitting one local and geometry-aware coordinate frame in each non-empty leaf node. Adjusting the orientation of the local grid, as well as the anisotropic scales of its axes, to the local surface shape greatly increases the amount of detail that can be stored in a given amount of memory, which in turn allows for quantization without loss of quality. With our optimized C++/CUDA implementation, GALA can be fitted to an object in less than 10 seconds. Moreover, the representation can efficiently be flattened and manipulated with transformer networks. We provide a cascaded generation pipeline capable of generating 3D shapes with great geometric detail.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。