Treffer: Anisotropic Gauss Reconstruction and Global Orientation with Octree‐based Acceleration.

Unoriented surface reconstruction is an important task in computer graphics. Recently, methods based on the Gauss formula or winding number have achieved state‐of‐the‐art performance in both orientation and surface reconstruction. The Gauss formula or winding number, derived from the fundamental solution of the Laplace equation, initially found applications in calculating potentials in electromagnetism. Inspired by the practical necessity of calculating potentials in diverse electromagnetic media, we consider the anisotropic Laplace equation to derive the anisotropic Gauss formula and apply it to surface reconstruction, called "anisotropic Gauss reconstruction". By leveraging the flexibility of anisotropic coefficients, additional constraints can be introduced to the indicator function. This results in a stable linear system, eliminating the need for any artificial regularization. In addition, the oriented normals can be refined by computing the gradient of the indicator function, ultimately producing high‐quality normals and surfaces. Regarding the space/time complexity, we propose an octree‐based acceleration algorithm to achieve a space complexity of O(N) and a time complexity of O(NlogN). Our method can reconstruct ultra‐large‐scale models (exceeding 5 million points) within 4 minutes on an NVIDIA RTX 4090 GPU. Extensive experiments demonstrate that our method achieves state‐of‐the‐art performance in both orientation and reconstruction, particularly for models with thin structures, small holes, or high genus. Both CuPy‐based and CUDA‐accelerated implementations are made publicly available at https://github.com/mayueji/AGR. [ABSTRACT FROM AUTHOR]

Copyright of Computer Graphics Forum is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)