Results 131 to 140 of about 152,398 (281)
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
RotGS: Rotation‐Guided 3D Gaussian Splatting for Turntable Sequences without Structure‐from‐Motion
Computer Graphics Forum, EarlyView.Abstract The field of 3D reconstruction from multi‐view images has advanced rapidly thanks to 3D Gaussian Splatting (3DGS), which enables efficient and photorealistic scene representation. However, optimizing 3DGS requires high‐quality images from various viewpoints with accurate camera poses.
Kyumin Kim +3 more
wiley +1 more source
3D Character Reconstruction from Hand‐drawn Model Sheets
Computer Graphics Forum, EarlyView.Abstract Hand‐drawn model sheets are widely used in character design to define 3D shape and appearance through sparse multi‐view drawings. Reconstructing 3D characters from such sparse inputs has traditionally been challenging due to insufficient visual information.
Hyejeong Yoon +3 more
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
The point decomposition problem in Jacobian varieties
, 2016 The discrete logarithm problem is a fundamental brick for several protocols for secured communications. Its instantiation over elliptic curves allows the deployment of efficient asymmetric primitives in embedded systems, because of the small size of the parameters considered.
openaire +1 more source
Mesh Processing Non‐Meshes via Neural Displacement Fields
Computer Graphics Forum, EarlyView.Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
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
Interpolated Adaptive Linear Reduced Order Modeling for Deformation Dynamics
Computer Graphics Forum, EarlyView.Abstract Linear reduced‐order modeling (ROM) is widely used for efficient simulation of deformation dynamics, but its accuracy is often limited by the fixed linearization of the reduced mapping. We propose a new adaptive strategy for linear ROM that allows the reduced mapping to vary dynamically in response to the evolving deformation state ...
Y. Tao, M. Chiaramonte, P. Fernandez
wiley +1 more source
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
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