Multilevel Solvers for Unstructured Surface Meshes

Parameterization of unstructured surface meshes is of fundamental importance in many applications of digital geometry processing. Such parameterization approaches give rise to large and exceedingly ill-conditioned systems which are difficult or impossible to solve without the use of sophisticated multilevel preconditioning strategies. Since the underlying meshes are very fine to begin with, such multilevel preconditioners require mesh coarsening to build an appropriate hierarchy. In this paper we consider several strategies for the construction of hierarchies using ideas from mesh simplification algorithms used in the computer graphics literature. We introduce two novel hierarchy construction schemes and demonstrate their superior performance when used in conjunction with a multigrid preconditioner

Bootstrap Multigrid for the Laplace-Beltrami Eigenvalue Problem

This paper introduces bootstrap two-grid and multigrid finite element approximations to the Laplace-Beltrami (surface Laplacian) eigen-problem on a closed surface. The proposed multigrid method is suitable for recovering eigenvalues having large multiplicity, computing interior eigenvalues, and approximating the shifted indefinite eigen-problem. Convergence analysis is carried out for a simplified two-grid algorithm and numerical experiments are presented to illustrate the basic components and ideas behind the overall bootstrap multigrid approach

Signal-Specialized Parameterization

To reduce memory requirements for texture mapping a model, we build a surface parametrization specialized to its signal (such as color or normal). Intuitively, we want to allocate more texture samples in regions with greater signal detail. Our approach is to minimize signal approximation error --- the difference between the original surface signal and its reconstruction from the sampled texture. Specifically, our signal-stretch parametrization metric is derived from a Taylor expansion of signal error. For fast evaluation, this metric is pre-integrated over the surface as a metric tensor. We minimize this nonlinear metric using a novel coarse-to-fine hierarchical solver, further accelerated with a fine-to-coarse propagation of the integrated metric tensor. Use of metric tensors permits anisotropic squashing of the parametrization along directions of low signal gradient. Texture area can often be reduced by a factor of 4 for a desired signal accuracy compared to non-specialized parametrizations.Engineering and Applied Science

Plane-Based Optimization of Geometry and Texture for RGB-D Reconstruction of Indoor Scenes

We present a novel approach to reconstruct RGB-D indoor scene with plane primitives. Our approach takes as input a RGB-D sequence and a dense coarse mesh reconstructed by some 3D reconstruction method on the sequence, and generate a lightweight, low-polygonal mesh with clear face textures and sharp features without losing geometry details from the original scene. To achieve this, we firstly partition the input mesh with plane primitives, simplify it into a lightweight mesh next, then optimize plane parameters, camera poses and texture colors to maximize the photometric consistency across frames, and finally optimize mesh geometry to maximize consistency between geometry and planes. Compared to existing planar reconstruction methods which only cover large planar regions in the scene, our method builds the entire scene by adaptive planes without losing geometry details and preserves sharp features in the final mesh. We demonstrate the effectiveness of our approach by applying it onto several RGB-D scans and comparing it to other state-of-the-art reconstruction methods.Comment: in International Conference on 3D Vision 2018; Models and Code: see https://github.com/chaowang15/plane-opt-rgbd. arXiv admin note: text overlap with arXiv:1905.0885

Covariant coarse-graining of inhomogeneous dust flow in General Relativity

A new definition of coarse-grained quantities describing the dust flow in General Relativity is proposed. It assigns the coarse--grained expansion, shear and vorticity to finite-size comoving domains of fluid in a covariant, coordinate-independent manner. The coarse--grained quantities are all quasi-local functionals, depending only on the geometry of the boundary of the considered domain. They can be thought of as relativistic generalizations of simple volume averages of local quantities in a flat space. The procedure is based on the isometric embedding theorem for S^2 surfaces and thus requires the boundary of the domain in question to have spherical topology and positive scalar curvature. We prove that in the limit of infinitesimally small volume the proposed quantities reproduce the local expansion, shear and vorticity. In case of irrotational flow we derive the time evolution for the coarse-grained quantities and show that its structure is very similar to the evolution equation for their local counterparts. Additional terms appearing in it may serve as a measure of the backreacton of small-scale inhomogeneities of the flow on the large-scale motion of the fluid inside the domain and therefore the result may be interesting in the context of the cosmological backreaction problem. We also consider the application of the proposed coarse-graining procedure to a number of known exact solutions of Einstein equations with dust and show that it yields reasonable results.Comment: 17 pages, 5 figures. Version accepted in Classical and Quantum Gravity