Results 131 to 140 of about 13,500,255 (277)
Skeletal‐Driven Animation of Anatomical Humans via Neural Deformation Gradients
Computer Graphics Forum, EarlyView.Abstract Most real‐time animation techniques for digital humans are limited to deforming the outer skin surface. Geometric skinning methods are highly efficient but struggle with artifacts such as collapsing joints or self‐intersections when animating inner anatomy along with the outer skin.
G. Nolte +3 more
wiley +1 more source
The convergence of quasi-Gauss-Newton methods for nonlinear problems
, 2018 Quasi-Gauss-Newton methods for nonlinear equations are investigated. A Quasi-Gauss-Newton method is proposed. In this method, the Jacobian is modified by a convex combination of Broyden's update and a weighted update.
김선영
core +1 more source
Superlinear Convergence of Smoothing Quasi-Newton Methods for Nonsmooth Equations
, 1996 We study local convergence of smoothing quasi-Newton methods for solving a system of nonsmooth (nondifferentiable) equations in ! n . The feature of smoothing quasi-Newton methods is to use a smooth function to approximate the nonsmooth mapping and ...
Xiaojun Chen
core
On the Characterization of Q-Superlinear Convergence of Quasi-Newton Interior-Point Methods for Nonlinear Programming [PDF]
, 1994 In this paper we extend the well-known Boggs-Tolle-Wang characterization of Q-superlinear convergence for quasi-Newton methods for equality constrained optimization to quasi-Newton interior-point methods for nonlinear programming. Critical issues in this
Parada, Z., Martinez, H.J., Tapia, R.A.
core
Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy
Computer 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
Computer Graphics Forum, EarlyView.Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel +2 more
wiley +1 more source
Large-Scale Quasi-Newton Trust-Region Methods: High-Accuracy Solvers, Dense Initializations, and Extensions [PDF]
, 2018 This dissertation describes optimization methods and matrix factorizations for large-scale quasi-Newton trust-region methods. The proposed methods are applicable to convex and non-convex optimization problems, and are described in algorithms for software
Brust, Johannes Joachim
core
Fast Nodal Hessian Computation for Peridynamic Fracture Simulation
Computer Graphics Forum, EarlyView.A fast, exact nodal Hessian computation for Non‐Ordinary State‐Based Peridynamics is introduced through analytical simplification and a warp‐centric GPU strategy. The method accelerates preconditioned solvers and Vertex Block Descent, enabling interactive fracture simulation with physical accuracy.
Yuxiong Qin +2 more
wiley +1 more source
GNOCHI: Generative Neural mOdel for Close Human‐Human Interactions
Computer Graphics Forum, EarlyView.Abstract Creating realistic 3D human‐human interactions in virtual environments is challenging due to the high degrees of freedom in human body and the need for physically accurate poses that do not collide with each other. Traditional methods for humanhuman interaction are based on motion tracking or 3D body reconstruction, but lack generative ...
Gonzalo Gómez‐Nogales +3 more
wiley +1 more source
Computer Graphics Forum, EarlyView.Abstract We present a fast, robust method for continuous collision detection (CCD) directly between pairs of complex signed distance fields (SDFs). By casting CCD as an alternating spatio‐temporal optimization and driving a small set of smartly sampled surface points along SDF tangent spaces, our approach avoids dense sampling or triangle meshes ...
Rasmus Gabelgaard Nielsen, Kenny Erleben
wiley +1 more source