Results 111 to 120 of about 25,672 (245)
A Cartesian-Based Trajectory Optimization with Jerk Constraints for a Robot. [PDF]
Entropy (Basel), 2023 Fan Z +7 more
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
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
OUGS: Active View Selection via Object‐aware Uncertainty Estimation in 3DGS
Computer Graphics Forum, EarlyView.Abstract Recent advances in 3D Gaussian Splatting (3DGS) have achieved state‐of‐the‐art results for novel view synthesis. However, efficiently capturing high‐fidelity reconstructions of specific objects within complex scenes remains a significant challenge.
Haiyi Li +3 more
wiley +1 more source
Hyper-Kähler Manifolds of Generalized Kummer Type and the Kuga-Satake Correspondence. [PDF]
Milan J Math, 2022 Varesco M, Voisin C.
europepmc +1 more source
Stochastic Pairwise MIS for Unbiased Large‐Kernel Reuse in Real‐Time
Computer Graphics Forum, EarlyView.Abstract Spatiotemporal resampling methods such as ReSTIR decrease noise in Monte Carlo rendering of dynamic content by reusing paths across frames and pixels. Standard ReSTIR reuses spatially from a small number of randomly selected neighbors. This reuse suffers when few neighbors contain contributing samples, reducing quality toward that of the ...
Trevor Hedstrom +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
New reduction in the Jacobian conjecture. [PDF]
, 2001 Summary: It is sufficient to consider in the Jacobian conjecture (for every \(n>1\)) only polynomial mappings of cubic linear form \(F(x)=x+(Ax)^{*3}\), i.e. \[ F(x)=(x_1+(a^1_1 x_1+\dots+a^1_n x_n)^3,\dots, x_n+(a^n_1x_1+\dots+a^n_nx_n)^3), \] where the matrix \(F'(x)-I=3\Delta((Ax)^{*2})A\) is nilpotent for every \(x=(x_1,\dots,x_n)\).
openaire +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
Embedding Optimization of Layouts via Distortion Minimization
Computer 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