Results 141 to 150 of about 11,443 (267)
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
Real‐Time Conformal Maps and Parameterizations
Computer 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
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
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
Asymptotic behavior of Laplacian-energy-like invariant of the 3.6.24 lattice with various boundary conditions. [PDF]
Springerplus, 2016 Liu JB, Cao J, Hayat T, Alsaadi FE.
europepmc +1 more source
Guest Editorial: Graph Representation Learning for Feature Extraction and Signal Processing
CAAI Transactions on Intelligence Technology, EarlyView.
Xin Ning
wiley +1 more source
LeafFit: Plant Assets Creation from 3D Gaussian Splatting
Computer Graphics Forum, EarlyView.Abstract We propose LeafFit, a pipeline that converts 3D Gaussian Splatting (3DGS) of individual plants into editable, instanced mesh assets. While 3DGS faithfully captures complex foliage, its high memory footprint and lack of mesh topology make it incompatible with traditional game production workflows. We address this by leveraging the repetition of
Chang Luo, Nobuyuki Umetani
wiley +1 more source
Affinification: A Fine Approximation of Deformations
Computer Graphics Forum, EarlyView.Abstract We introduce affinification, a novel method for accelerating physics‐based animation of elastic solids. During a time‐dependent simulation, our method automatically partitions the space into affine and elastic regions depending on the deformation.
A. Mercier‐Aubin +3 more
wiley +1 more source
Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy
, 2015 The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on n nodes and m edges is conjectured to be attained for ...
Trevisan, Vilmar, Helmberg, Christoph
core