Results 201 to 210 of about 122,674 (274)

Computing Skinning Weights via Convex Duality

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

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

Progressively Projected Newton's Method

open access: yesComputer Graphics Forum, EarlyView.
Abstract Newton's Method is widely used to find the solution of complex non‐linear simulation problems. To guarantee a descent direction, it is common practice to clamp the negative eigenvalues of each element Hessian prior to assembly—a strategy known as Projected Newton (PN)—but this perturbation often hinders convergence.
J. A. Fernández‐Fernández   +2 more
wiley   +1 more source

The Category of Anyon Sectors for Non-Abelian Quantum Double Models. [PDF]

open access: yesCommun Math Phys
Bols A   +3 more
europepmc   +1 more source

Survey on differential estimators for 3d point clouds

open access: yesComputer Graphics Forum, EarlyView.
Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger   +4 more
wiley   +1 more source

Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy

open access: yesComputer Graphics Forum, EarlyView.
Abstract The As‐Rigid‐As‐Possible (ARAP) energy [SA07] has become a versatile ingredient in various geometry processing and machine learning methods. The classic method for its minimization is a block coordinate descent, alternating between local rotation estimation and a global linear solve, which converges slowly for large problem instances.
Hendrik Meyer, Bernd Bickel, Marc Alexa
wiley   +1 more source

Home - About - Disclaimer - Privacy