Results 121 to 130 of about 9,253 (248)
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
Journal of New Theory, 2017 We introduce the concept of Path Laplacian Matrix for a graph and explore the eigenvalues of this matrix. The eigenvalues of this matrix are called the path Laplacian eigenvalues of the graph. We investigate path Laplacian eigenvalues of some classes of graph. Several results concerning path Laplacian eigenvalues of graphs have been obtained.
PATEKAR, Shridhar Chandrakant +1 more
openaire +2 more sources
Advances in Nonlinear AnalysisIn this work, we examine the initial boundary value problem for the thermoelastic system with pp-Laplacian, subject to a novel nonlinearity condition within a bounded domain.
Chen Yuxuan
doaj +1 more source
Distributed k‐WTA Network for Multi‐Manipulator Competition With Experimental Verifications
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT In this article, a new distributed k $k$‐winner‐take‐all (Dk $k$‐WTA) network is designed and used to construct a dynamic allocation scheme for competitive coordination tasks of multiple manipulators as embodied agents. The scheme is constructed based on the following two aspects. On one hand, with reference to a perspective that the Laplacian
Shengkai Sun, Yutong Li, Jianfeng Lv
wiley +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
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
On Radenković and Gutman conjecture for some classes of trees of diameter 5
Electronic Journal of Graph Theory and ApplicationsThe Radenković and Gutman conjecture establishes a relationship between the Laplacian energies of any tree Tn, the star graph Sn and the path graph Pn, i.e., LE(Pn) ≤ LE(Tn) ≤ LE(Sn).
Afeefa Maryam +2 more
doaj +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
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
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