This paper presents a method to compute the quasi-conformal parameterization (QCMC) for a multiply-connected 2D domain or surface. QCMC computes a quasi-conformal map from a multiply-connected domain @math onto a punctured disk @math associated with a given Beltrami differential. The Beltrami differential, which measures the conformality distortion, is a complex-valued function @math with supremum norm strictly less than 1. Every Beltrami differential gives a conformal structure of @math . Hence, the conformal module of @math , which are the radii and centers of the inner circles, can be fully determined by @math , up to a M "obius transformation. In this paper, we propose an iterative algorithm to simultaneously search for the conformal module and the optimal quasi-conformal parameterization. The key idea is to minimize the Beltrami energy subject to the boundary constraints. The optimal solution is our desired quasi-conformal parameterization onto a punctured disk. The parameterization of the multiply-connected domain simplifies numerical computations and has important applications in various fields, such as in computer graphics and vision. Experiments have been carried out on synthetic data together with real multiply-connected Riemann surfaces. Results show that our proposed method can efficiently compute quasi-conformal parameterizations of multiply-connected domains and outperforms other state-of-the-art algorithms. Applications of the proposed parameterization technique have also been explored.
Parameterization has been widely studied and different parameterization algorihtms have been developed. The goal is to map a 2D complicated domain or 3D surface onto a simple parameter domain, such as the unit sphere or 2D rectangle. In general, 3D surfaces are not isometric to the simple parameter domains. As a result, parameterization usually causes distortion. @cite_10 proposed to obtain a close-to-isomtric parameterization, called the IsoMap, which minimizes geodesic distance distortion between pairs of vertices on the mesh. @cite_23 propose the discrete harmonic map for mesh parameterization, which approximates the continuous harmonic map by minimizing a metric dispersion criterion. @cite_32 proposed a parameterization, which is as area-preserving as possible, for texture mapping via optimal mass transportation. Graph embedding of a surface mesh has also been studied by Tutte @cite_33 . The parameterization technique, which is now called the Tutte's embedding, was introduced. The bijectivity of the parameterization is mathematically guaranteed. Floater @cite_21 improved the quality of the parameterization by introducing specific weights, in terms of area deformations and conformality.
@cite_33 @cite_21 @cite_32 @cite_23 @cite_10
1980993650 1976584051 2096817454 2109389549
High-quality volumetric parameterization of computational domain plays an important role in three-dimensional isogeometric analysis. Reparameterization technique can improve the distribution of isoparametric curves surfaces without changing the geometry. In this paper, using the reparameterization method, we investigate the high-quality construction of analysis-suitable NURBS volumetric parameterization. Firstly, we introduce the concept of volumetric reparameterization, and propose an optimal Mobius transformation to improve the quality of the isoparametric structure based on a new uniformity metric. Secondly, from given boundary NURBS surfaces, we present a two-stage scheme to construct the analysis-suitable volumetric parameterization: in the first step, uniformity-improved reparameterization is performed on the boundary surfaces to achieve high-quality isoparametric structure without changing the shape; in the second step, from a new variational harmonic metric and the reparameterized boundary surfaces, we construct the optimal inner control points and weights to achieve an analysis-suitable NURBS solid. Several examples with complicated geometry are presented to illustrate the effectiveness of proposed methods. Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and more detailed, there is an increased need for fast and robust techniques to automatically compute least-distorted parameterizations of large meshes. In this paper, we present new theoretical and practical results on the parameterization of triangulated surface patches. Given a few desirable properties such as rotation and translation invariance, we show that the only admissible parameterizations form a two-dimensional set and each parameterization in this set can be computed using a simple, sparse, linear system. Since these parameterizations minimize the distortion of different intrinsic measures of the original mesh, we call them Intrinsic Parameterizations. In addition to this partial theoretical analysis, we propose robust, efficient and tunable tools to obtain least-distorted parameterizations automatically. In particular, we give details on a novel, fast technique to provide an optimal mapping without fixing the boundary positions, thus providing a unique Natural Intrinsic Parameterization. Other techniques based on this parameterization family, designed to ease the rapid design of parameterizations, are also proposed. Parameterization of complex surfaces constitutes a major means of visualizing highly convoluted geometric structures as well as other properties associated with the surface. It also enables users with the ability to navigate, orient, and focus on regions of interest within a global view and overcome the occlusions to inner concavities. In this paper, we propose a novel area-preserving surface parameterization method which is rigorous in theory, moderate in computation, yet easily extendable to surfaces of non-disc and closed-boundary topologies. Starting from the distortion induced by an initial parameterization, an area restoring diffeomorphic flow is constructed as a Lie advection of differential 2-forms along the manifold, which yields equality of the area elements between the domain and the original surface at its final state. Existence and uniqueness of result are assured through an analytical derivation. Based upon a triangulated surface representation, we also present an efficient algorithm in line with discrete differential modeling. As an exemplar application, the utilization of this method for the effective visualization of brain cortical imaging modalities is presented. Compared with conformal methods, our method can reveal more subtle surface patterns in a quantitative manner. It, therefore, provides a competitive alternative to the existing parameterization techniques for better surface-based analysis in various scenarios. In isogeometric analysis, parameterization of computational domain has great effects as mesh generation in finite element analysis. In this paper, based on the concept of harmonic mapping from the computational domain to parametric domain, a variational harmonic approach is proposed to construct analysis-suitable parameterization of computational domain from CAD boundary for 2D and 3D isogeometric applications. Different from the previous elliptic mesh generation method in finite element analysis, the proposed method focuses on isogeometric version, and converts the elliptic PDE into a nonlinear optimization problem, in which a regular term is integrated into the optimization formulation to achieve more uniform and orthogonal iso-parametric structure near convex (concave) parts of the boundary. Several examples are presented to show the efficiency of the proposed method in 2D and 3D isogeometric analysis.