Results 131 to 140 of about 390 (251)
Lateral heat flux reduction using a lock-in thermography compensation method. [PDF]
Sci Rep, 2023 Rittmann J, Kreutzbruck M.
europepmc +1 more source
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Real‐Time Conformal Maps and Parameterizations
Computer Graphics Forum, EarlyView.Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source
Prediction of stable radon fluoride molecules and geometry optimization using first-principles calculations. [PDF]
Sci Rep, 2023 Kang J, Park I, Shim JH, Kim DY, Um W.
europepmc +1 more source
Resolvent Flows for Convex Functionals and p-Harmonic Maps
Analysis and Geometry in Metric Spaces, 2015 Abstract We prove the unique existence of the (non-linear) resolvent associated to a coercive proper lower semicontinuous function satisfying a weak notion of p-uniform λ-convexity on a complete metric space, and establish the existence of the minimizer of such functions as the large time limit of the resolvents, which generalizing ...
openaire +2 more sources
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Computer Graphics Forum, EarlyView.Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
Hermite-Hadamard and Fejér type inequalities for strongly harmonically convex functions [PDF]
, 2016 Introducimos la noción de funciones fuertemente armónicas convexas y presentamos algunso ejemplos y propiedades de ésta clase. También, establecemos algunas desigualdades del tipo Hermite-Hadamard and y Fejér para la clase introducida.We introduce the ...
Bracamonte, Mireya
core +1 more source
Neural Local Inter‐reflection Modeling for Garment Fold Rendering
Computer Graphics Forum, EarlyView.Abstract Realistic garment rendering requires simulating complex multi‐bounce light paths within intricate fold geometries. In these regions, conventional path tracing is computationally expensive as light becomes trapped, necessitating high bounce counts for convergence.
Jooeun Son +4 more
wiley +1 more source
Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities
Computer Graphics Forum, EarlyView.Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev +14 more
wiley +1 more source
POTENTIAL REDUCTION METHOD FOR HARMONICALLY CONVEX-PROGRAMMING [PDF]
, 1995 In this paper, we introduce a potential reduction method for harmonically convex programming. We show that, if the objective function and the m constraint functions are all k-harmonically convex in the feasible set, then the number of iterations needed ...
Zhang, S (Shuzhong), ZHANG, S, STURM, JF
core