Results 121 to 130 of about 5,352,010 (246)

Real‐Time Conformal Maps and Parameterizations

open access: yesComputer 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

A Note on Shapleys Convex Measure Games [PDF]

open access: yes
L. S. Shapley, in his paper Cores of Convex Games, introduces Convex Measure Games, those that are induced by a convex function on R, acting over a measure on the coalitions.
Fco. Javier Martinez de Albeniz Salas   +1 more
core  

Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation

open access: yesComputer 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

Resolvent Flows for Convex Functionals and p-Harmonic Maps

open access: yesAnalysis 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

Neural Local Inter‐reflection Modeling for Garment Fold Rendering

open access: yesComputer 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

Molecular mechanism and energetics of coupling between substrate binding and product release in the F1-ATPase catalytic cycle. [PDF]

open access: yesProc Natl Acad Sci U S A, 2023
Badocha M   +5 more
europepmc   +1 more source

Fejer Type Inequalities for Harmonically (s,m)-Convex Functions [PDF]

open access: yes, 2016
In this paper, a new weighted identity involving harmonically symmetric functions and differentiable functions is established. By using the notion of harmonic symmetricity, harmonic (s,m)-convexity, analysis and some auxiliary results, some new Fejér ...
Dragomir, Silvestru Sever   +6 more
core  

Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities

open access: yesComputer 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

Embedding Optimization of Layouts via Distortion Minimization

open access: yesComputer Graphics Forum, EarlyView.
Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley   +1 more source

Class Angular Distortion Index for Dimensionality Reduction

open access: yesComputer Graphics Forum, EarlyView.
Abstract Dimensionality reduction (DR) techniques are often characterized by whether they preserve global, high‐level structures in the data or local, neighborhood structures. This distinction matters in visualization: global methods can obscure clusters while local methods can over‐emphasize them.
Kaviru Gunaratne   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy