Results 121 to 130 of about 102,179 (232)
On spectrum and energies of enhanced power graphs
Mathematics OpenThe enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj +1 more source
Agricultural and Forest Entomology, EarlyView.Coccinellidae (Coleoptera), Miridae (Hemiptera), Hemerobiidae (Neuroptera), Pentatomidae (Hemiptera), Anystidae (Acari), Erythraeidae (Acari) and spiders (Araneidae, Oxyopidae and Salticidae) fed on the invasive paropsine leaf beetles in Marlborough, New Zealand.
Souradji I. Bachirou +2 more
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
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
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
Ain Shams Engineering JournalIn this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj +1 more source
Some remarks on Laplacian eigenvalues and Laplacian energy of graphs
Mathematical Communications, 2010 Suppose $\mu_1$, $\mu_2$, ... , $\mu_n$ are Laplacian eigenvalues of a graph $G$. The Laplacian energy of $G$ is defined as $LE(G) = \sum_{i=1}^n|\mu_i - 2m/n|$. In this paper, some new bounds for the Laplacian eigenvalues and Laplacian energy of some special types of the subgraphs of $K_n$ are presented.
Ashrafi, Ali Reza +1 more
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