We describe a method for the generation of seamless surface parametrizations with guaranteed local injectivity and full control over holonomy. Previous methods guarantee only one of the two. Local injectivity is required to enable these parametrizations' use in applications such as surface quadrangulation and spline construction. Holonomy control is crucial to enable guidance or prescription of the parametrization's isocurves based on directional information, in particular from cross-fields or feature curves, and more generally to constrain the parametrization topologically. To this end we investigate the relation between cross-field topology and seamless parametrization topology. Leveraging previous results on locally injective parametrization and combining them with insights on this relation in terms of holonomy, we propose an algorithm that meets these requirements. A key component relies on the insight that arbitrary surface cut graphs, as required for global parametrization, can be homeomorphically modified to assume almost any set of turning numbers with respect to a given target cross-field.
more »
« less
Seamless Parametrization in Penner Coordinates
We introduce a conceptually simple and efficient algorithm for seamless parametrization, a key element in constructing quad layouts and texture charts on surfaces. More specifically, we consider the construction of parametrizations with prescribedholonomy signaturesi.e., a set of angles at singularities, and rotations along homology loops, preserving which is essential for constructing parametrizations following an input field, as well as for user control of the parametrization structure. Our algorithm performs exceptionally well on a large dataset based on Thingi10k [Zhou and Jacobson 2016], (16156 meshes) as well as on a challenging smaller dataset of [Myles et al. 2014], converging, on average, in 9 iterations. Although the algorithm lacks a formal mathematical guarantee, presented empirical evidence and the connections between convex optimization and closely related algorithms, suggest that a similar formulation can be found for this algorithm in the future.
more »
« less
- Award ID(s):
- 2313156
- PAR ID:
- 10625354
- Publisher / Repository:
- ACM
- Date Published:
- Journal Name:
- ACM Transactions on Graphics
- Volume:
- 43
- Issue:
- 4
- ISSN:
- 0730-0301
- Page Range / eLocation ID:
- 1 to 13
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract The gravity wave drag parametrization of the Whole Atmosphere Community Climate Model (WACCM) has been modified to include the wave‐driven atmospheric vertical mixing caused by propagating, non‐breaking, gravity waves. The strength of this atmospheric mixing is represented in the model via the “effective wave diffusivity” coefficient (Kwave). UsingKwave, a new total dynamical diffusivity (KDyn) is defined.KDynrepresents the vertical mixing of the atmosphere by both breaking (dissipating) and vertically propagating (non‐dissipating) gravity waves. Here we show that, when the new diffusivity is used, the downward fluxes of Fe and Na between 80 and 100 km largely increase. Larger meteoric ablation injection rates of these metals (within a factor 2 of measurements) can now be used in WACCM, which produce Na and Fe layers in good agreement with lidar observations. Mesospheric CO2is also significantly impacted, with the largest CO2concentration increase occurring between 80 and 90 km, where model‐observations agreement improves. However, in regions where the model overestimates CO2concentration, the new parametrization exacerbates the model bias. The mesospheric cooling simulated by the new parametrization, while needed, is currently too strong almost everywhere. The summer mesopause in both hemispheres becomes too cold by about 30 K compared to observations, but it shifts upward, partially correcting the WACCM low summer mesopause. Our results highlight the far‐reaching implications and the necessity of representing vertically propagating non‐breaking gravity waves in climate models. This novel method of modeling gravity waves contributes to growing evidence that it is time to move away from dissipative‐only gravity wave parametrizations.more » « less
-
Abstract This investigation presents a generally applicable framework for parameterizing interatomic potentials to accurately capture large deformation pathways. It incorporates a multi-objective genetic algorithm, training and screening property sets, and correlation and principal component analyses. The framework enables iterative definition of properties in the training and screening sets, guided by correlation relationships between properties, aiming to achieve optimal parametrizations for properties of interest. Specifically, the performance of increasingly complex potentials, Buckingham, Stillinger-Weber, Tersoff, and modified reactive empirical bond-order potentials are compared. Using MoSe2as a case study, we demonstrate good reproducibility of training/screening properties and superior transferability. For MoSe2, the best performance is achieved using the Tersoff potential, which is ascribed to its apparent higher flexibility embedded in its functional form. These results should facilitate the selection and parametrization of interatomic potentials for exploring mechanical and phononic properties of a large library of two-dimensional and bulk materials.more » « less
-
The primal variational formulation of the fourth-order Cahn-Hilliard equation requires C1-continuous finite element discretizations, e.g., in the context of isogeometric analysis. In this paper, we explore the variational imposition of essential boundary conditions that arise from the thermodynamic derivation of the Cahn-Hilliard equation in primal variables. Our formulation is based on the symmetric variant of Nitsche's method, does not introduce additional degrees of freedom and is shown to be variationally consistent. In contrast to strong enforcement, the new boundary condition formulation can be naturally applied to any mapped isogeometric parametrization of any polynomial degree. In addition, it preserves full accuracy, including higher-order rates of convergence, which we illustrate for boundary-fitted discretizations of several benchmark tests in one, two and three dimensions. Unfitted Cartesian B-spline meshes constitute an effective alternative to boundary-fitted isogeometric parametrizations for constructing C1-continuous discretizations, in particular for complex geometries. We combine our variational boundary condition formulation with unfitted Cartesian B-spline meshes and the finite cell method to simulate chemical phase segregation in a composite electrode. This example, involving coupling of chemical fields with mechanical stresses on complex domains and coupling of different materials across complex interfaces, demonstrates the flexibility of variational boundary conditions in the context of higher-order unfitted isogeometric discretizations.more » « less
-
Abstract The optimization of quantum circuits can be hampered by a decay of average gradient amplitudes with increasing system size. When the decay is exponential, this is called the barren plateau problem. Considering explicit circuit parametrizations (in terms of rotation angles), it has been shown in Arrasmithet al(2022Quantum Sci. Technol.7045015) that barren plateaus are equivalent to an exponential decay of the variance of cost-function differences. We show that the issue is particularly simple in the (parametrization-free) Riemannian formulation of such optimization problems and obtain a tighter bound for the cost-function variance. An elementary derivation shows that the single-gate variance of the cost function isstrictly equalto half the variance of the Riemannian single-gate gradient, where we sample variable gates according to the uniform Haar measure. The total variances of the cost function and its gradient are then both bounded from above by the sum of single-gate variances and, conversely, bound single-gate variances from above. So, decays of gradients and cost-function variations go hand in hand, and barren plateau problems cannot be resolved by avoiding gradient-based in favor of gradient-free optimization methods.more » « less
An official website of the United States government

