اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficient conformal parameterization of multiply-connected surfaces using quasi-conformal theory
120
0
0.0
(
0
)
تأليف
Gary P. T. Choi
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Conformal mapping, a classical topic in complex analysis and differential geometry, has become a subject of great interest in the area of surface parameterization in recent decades with various applications in science and engineering. However, most of the existing conformal parameterization algorithms only focus on simply-connected surfaces and cannot be directly applied to surfaces with holes. In this work, we propose two novel algorithms for computing the conformal parameterization of multiply-connected surfaces. We first develop an efficient method for conformally parameterizing an open surface with one hole to an annulus on the plane. Based on this method, we then develop an efficient method for conformally parameterizing an open surface with $k$ holes onto a unit disk with $k$ circular holes. The conformality and bijectivity of the mappings are ensured by quasi-conformal theory. Numerical experiments and applications are presented to demonstrate the effectiveness of the proposed methods.
قيم البحث
اقرأ أيضاً
With the advancement in 3D scanning technology, there has been a surge of interest in the use of point clouds in science and engineering. To facilitate the computations and analyses of point clouds, prior works have considered parameterizing them ont
o some simple planar domains with a fixed boundary shape such as a unit circle or a rectangle. However, the geometry of the fixed shape may lead to some undesirable distortion in the parameterization. It is therefore more natural to consider free-boundary conformal parameterizations of point clouds, which minimize the local geometric distortion of the mapping without constraining the overall shape. In this work, we develop a free-boundary conformal parameterization method for disk-type point clouds, which involves a novel approximation scheme of the point cloud Laplacian with accumulated cotangent weights together with a special treatment at the boundary points. With the aid of the free-boundary conformal parameterization, high-quality point cloud meshing can be easily achieved. Furthermore, we show that using the idea of conformal welding in complex analysis, the point cloud conformal parameterization can be computed in a divide-and-conquer manner. Experimental results are presented to demonstrate the effectiveness of the proposed method.
In this work, we present a novel, integrated rigged character simulation framework in Conformal Geometric Algebra (CGA) that supports, for the first time, real-time cuts and tears, before and/or after the animation, while maintaining deformation topo
logy. The purpose of using CGA is to lift several restrictions posed by current state-of-the-art character animation & deformation methods. Previous implementations originally required weighted matrices to perform deformations, whereas, in the current state-of-the-art, dual-quaternions handle both rotations and translations, but cannot handle dilations. CGA is a suitable extension of dual-quaternion algebra that amends these two major previous shortcomings: the need to constantly transmute between matrices and dual-quaternions as well as the inability to properly dilate a model during animation. Our CGA algorithm also provides easy interpolation and application of all deformations in each intermediate steps, all within the same geometric framework. Furthermore we also present two novel algorithms that enable cutting and tearing of the input rigged, animated model, while the output model can be further re-deformed. These interactive, real-time cut and tear operations can enable a new suite of applications, especially under the scope of a medical surgical simulation.
We implement a version of conformal field theory in a doubly connected domain to connect it to the theory of annulus SLE of various types, including the standard annulus SLE, the reversible annulus SLE, and the annulus SLE with several force points.
This implementation considers the statistical fields generated under the OPE multiplication by the Gaussian free field and its central/background charge modifications with a weighted combination of Dirichlet and excursion-reflected boundary conditions. We derive the Eguchi-Ooguri version of Wards equations and Belavin-Polyakov-Zamolodchikov equations for those statistical fields and use them to show that the correlations of fields in the OPE family under the insertion of the one-leg operators are martingale-observables for variants of annulus SLEs. We find Coulomb gas (Dotsenko-Fateev integral) solutions to the parabolic partial differential equations for partition functions of conformal field theory for the reversible annulus SLE.
The dynamics of low energy electrons in general static strained graphene surface is modelled mathematically by the Dirac equation in curved space-time. In Cartesian coordinates, a parametrization of the surface can be straightforwardly obtained, but
the resulting Dirac equation is intricate for general surface deformations. Two different strategies are introduced to simplify this problem: the diagonal metric approximation and the change of variables to isothermal coordinates. These coordinates are obtained from quasi-conformal transformations characterized by the Beltrami equation, whose solution gives the mapping between both coordinate systems. To implement this second strategy, a least square finite-element numerical scheme is introduced to solve the Beltrami equation. The Dirac equation is then solved via an accurate pseudo-spectral numerical method in the pseudo-Hermitian representation that is endowed with explicit unitary evolution and conservation of the norm. The two approaches are compared and applied to the scattering of electrons on Gaussian shaped graphene surface deformations. It is demonstrated that electron wave packets can be focused by these local strained regions.
An efficient computer algorithm is described for the perspective drawing of a wide class of surfaces. The class includes surfaces corresponding lo single-valued, continuous functions which are defined over rectangular domains. The algorithm automatic
ally computes and eliminates hidden lines. The number of computations in the algorithm grows linearly with the number of sample points on the surface to be drawn. An analysis of the algorithm is presented, and extensions lo certain multi-valued functions are indicated. The algorithm is implemented and tested on .Net 2.0 platform that left interactive use. Running times are found lo be exceedingly efficient for visualization, where interaction on-line and view-point control, enables effective and rapid examination of a surfaces from many perspectives.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
