Search for:All records

Creators/Authors contains: "Luo, Zhongxuan"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

1. (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. (Ed.)
Optimal transportation (OT) finds the most economical way to transport one measure to another and plays an important role in geometric modeling and processing. Based on the Brenier theorem, the OT problem is equivalent to the Alexandrov problem, which is the dual to the Pogorelov problem. Although solving the Alexandrov/Pogorelov problem are both equivalent to solving the Monge-Amp\`{e}re equation, the former requires second type boundary condition and the latter requires much simpler Dirichlet boundary condition. Hence, we propose to use the Pogorelov map to approximate the OT map. The Pogorelov problem can be solved by a convex geometric optimization framework, in which we need to ensure the searching inside the admissible space. In this work, we prove the discrete Alexandrov maximum principle, which gives an apriori estimate of the searching. Our experimental results demonstrate that the Pogorelov map does approximate the OT map well with much more efficient computation.
more » « less
3. (Ed.)
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
4. (Ed.)
5. Generative adversarial networks (GANs) have attracted huge attention due to its capability to generate visual realistic images. However, most of the existing models suffer from the mode collapse or mode mixture problems. In this work, we give a theoretic explanation of the both problems by Figalli’s regularity theory of optimal transportation maps. Basically, the generator compute the transportation maps between the white noise distributions and the data distributions, which are in general discontinuous. However, DNNs can only represent continuous maps. This intrinsic conflict induces mode collapse and mode mixture. In order to tackle the both problems, we explicitly separate the manifold embedding and the optimal transportation; the first part is carried out using an autoencoder to map the images onto the latent space; the second part is accomplished using a GPU-based convex optimization to find the discontinuous transportation maps. Composing the extended OT map and the decoder, we can finally generate new images from the white noise. This AE-OT model avoids representing discontinuous maps by DNNs, therefore effectively prevents mode collapse and mode mixture.
more » « less