skip to main content


Title: Quadrilateral mesh generation II: Meromorphic quartic differentials and Abel–Jacobi condition
This work discovers the equivalence relation between quadrilateral meshes and meromorphic quartic differentials. Each quad-mesh induces a conformal structure of the surface, and a meromorphic quartic differential, where the configuration of singular vertices corresponds to the configurations of the poles and zeros (divisor) of the meromorphic differential. Due to Riemann surface theory, the configuration of singularities of a quad-mesh satisfies the Abel–Jacobi condition. Inversely, if a divisor satisfies the Abel–Jacobi condition, then there exists a meromorphic quartic differential whose divisor equals the given one. Furthermore, if the meromorphic quartic differential is with finite trajectories, then it also induces a quad-mesh, the poles and zeros of the meromorphic differential correspond to the singular vertices of the quad-mesh. Besides the theoretic proofs, the computational algorithm for verification of Abel–Jacobi condition is also explained in detail. Furthermore, constructive algorithm of meromorphic quartic differential on genus zero surfaces is proposed, which is based on the global algebraic representation of meromorphic differentials. Our experimental results demonstrate the efficiency and efficacy of the algorithm. This opens up a novel direction for quad-mesh generation using algebraic geometric approach.  more » « less
Award ID(s):
1762287
NSF-PAR ID:
10291667
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
Computer methods in applied mechanics and engineering
Volume:
366
ISSN:
1879-2138
Page Range / eLocation ID:
112980
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    This work proposes a rigorous and practical algorithm for quad-mesh generation based the Abel-Jacobi theory of algebraic \textcolor{red}{curves}. We prove sufficient and necessary conditions for a flat metric with cone singularities to be compatible with a quad-mesh, in terms of the deck-transformation, then develop an algorithm based on the theorem. The algorithm has two stages: first, a meromorphic quartic differential is generated to induce a T-mesh; second, the edge lengths of the T-mesh are adjusted by solving a linear system to satisfy the deck transformation condition, which produces a quad-mesh. In the first stage, the algorithm pipeline can be summarized as follows: calculate the homology group; compute the holomorphic differential group; construct the period matrix of the surface and Jacobi variety; calculate the Abel-Jacobi map for a given divisor; optimize the divisor to satisfy the Abel-Jacobi condition by integer programming; compute \textcolor{red}{a} flat Riemannian metric with cone singularities at the divisor by Ricci flow; \textcolor{red}{isometrically} immerse the surface punctured at the divisor onto the complex plane and pull back the canonical holomorphic differential to the surface to obtain the meromorphic quartic differential; construct a motorcycle graph to generate a T-Mesh. In the second stage, the deck transformation constraints are formulated as a linear equation system of the edge lengths of the T-mesh. The solution provides a flat metric with integral deck transformations, which leads to the final quad-mesh. The proposed method is rigorous and practical. The T-mesh and quad-mesh results can be applied for constructing Splines directly. The efficiency and efficacy of the proposed algorithm are demonstrated by experimental results on surfaces with complicated topologies and geometries. 
    more » « less
  2. A bstract We study Euclidean D3-branes wrapping divisors D in Calabi-Yau orientifold compactifications of type IIB string theory. Witten’s counting of fermion zero modes in terms of the cohomology of the structure sheaf $$ {\mathcal{O}}_D $$ O D applies when D is smooth, but we argue that effective divisors of Calabi-Yau threefolds typically have singularities along rational curves. We generalize the counting of fermion zero modes to such singular divisors, in terms of the cohomology of the structure sheaf $$ {\mathcal{O}}_{\overline{D}} $$ O D ¯ of the normalization $$ \overline{D} $$ D ¯ of D . We establish this by detailing compactifications in which the singularities can be unwound by passing through flop transitions, giving a physical incarnation of the normalization process. Analytically continuing the superpotential through the flops, we find that singular divisors whose normalizations are rigid can contribute to the superpotential: specifically, $$ {h}_{+}^{\bullet}\left({\mathcal{O}}_{\overline{D}}\right)=\left(1,0,0\right) $$ h + • O D ¯ = 1 0 0 and $$ {h}_{-}^{\bullet}\left({\mathcal{O}}_{\overline{D}}\right)=\left(0,0,0\right) $$ h − • O D ¯ = 0 0 0 give a sufficient condition for a contribution. The examples that we present feature infinitely many isomorphic geometric phases, with corresponding infinite-order monodromy groups Γ. We use the action of Γ on effective divisors to determine the exact effective cones, which have infinitely many generators. The resulting nonperturbative superpotentials are Jacobi theta functions, whose modular symmetries suggest the existence of strong-weak coupling dualities involving inversion of divisor volumes. 
    more » « less
  3. We construct a monomorphism of the De Rham complex of scalar multivalued meromorphic forms on the projective line, holomorphic on the complement to a finite set of points, to the chain complex of the Lie algebra of sl_2-valued algebraic functions on the same complement with coefficients in a tensor product of contragradient Verma modules over the affine Lie algebra \hat{sl}_2. We show that the existence of singular vectors in the Verma modules (the Malikov-Feigin-Fuchs singular vectors) is reflected in the new relations between the cohomology classes of logarithmic differential forms. 
    more » « less
  4. We consider two complexes. The first complex is the twisted de Rham complex of scalar meromorphic differential forms on projective line, holomorphic on the complement to a finite set of points. The second complex is the chain complex of the Lie algebra of sl2-valued algebraic functions on the same complement, with coefficients in a tensor product of contragradient Verma modules over the affine Lie algebra sl2^. In [Schechtman V., Varchenko A., Mosc. Math. J. 17 (2017), 787-802] a construction of a monomorphism of the first complex to the second was suggested and it was indicated that under this monomorphism the existence of singular vectors in the Verma modules (the Malikov-Feigin-Fuchs singular vectors) is reflected in the relations between the cohomology classes of the de Rham complex. In this paper we prove these results. △ Less 
    more » « less
  5. null (Ed.)
    The performance of private gradient-based optimization algorithms is highly dependent on the choice of step size (or learning rate) which often requires non-trivial amount of tuning. In this paper, we introduce a stochastic variant of classic backtracking line search algorithm that satisfies Renyi differential privacy. Specifically, the proposed algorithm adaptively chooses the step size satisfying the the Armijo condition (with high probability) using noisy gradients and function estimates. Furthermore, to improve the probability with which the chosen step size satisfies the condition, it adjusts per-iteration privacy budget during runtime according to the reliability of noisy gradient. A naive implementation of the backtracking search algorithm may end up using unacceptably large privacy budget as the ability of adaptive step size selection comes at the cost of extra function evaluations. The proposed algorithm avoids this problem by using the sparse vector technique combined with the recent privacy amplification lemma. We also introduce a privacy budget adaptation strategy in which the algorithm adaptively increases the budget when it detects that directions pointed by consecutive gradients are drastically different. Extensive experiments on both convex and non-convex problems show that the adaptively chosen step sizes allow the proposed algorithm to efficiently use the privacy budget and show competitive performance against existing private optimizers. 
    more » « less