Results 141 to 150 of about 13,640 (282)
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
Universal Adjacency Matrices with Two Eigenvalues
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core
, 2019 U ovom završnom radu definirat ćemo osnovne pojmove vezane uz Laplacijan grafa odnosno Laplaceovu matricu grafa. Opisat ćemo vezu Laplaceove matrice grafa sa matricom susjedstva i matricom incidencije, pokazati osnovna svojstva Laplacijana i reći nešto o
Oguić, Matej
core
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph
, 2010 The energy of a graph G is defined as the sum of the singular values of its adjacency matrix and the Laplacian energy of G is defined as the sum of the distance between Laplacian eigenvalues and average degree of G.
Zhongzhu Liu
core
Lower bounds of the Laplacian graph eigenvalues
, 2004 In this paper we prove that all positive eigenvalues of the Laplacian of an arbitrary simple graph have some positive lower bounds. For a fixed integer k ⩾ 1 we call a graph without isolated vertices k-minimal if its kth greatest Laplacian eigenvalue ...
Torgašev, Aleksandar +1 more
core +1 more source
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +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
Further results on permanents of Laplacian matrices of trees
Open MathematicsThe research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj +1 more source
Joint Lp-Norm and L2,1-Norm Constrained Graph Laplacian PCA for Robust Tumor Sample Clustering and Gene Network Module Discovery. [PDF]
Front Genet, 2021 Kong XZ +6 more
europepmc +1 more source