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
Fractional revival of threshold graphs under Laplacian dynamics
, 2020 We consider Laplacian fractional revival between two vertices of a graph $X$. Assume that it occurs at time $\tau$ between vertices 1 and 2. We prove that for the spectral decomposition $L = \sum_{r=0}^q \theta_rE_r$ of the Laplacian matrix $L$ of $X ...
Kirkland, S., Zhang, X.
core
Constructing Connectome Atlas by Graph Laplacian Learning. [PDF]
Neuroinformatics, 2021 Kim M +5 more
europepmc +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
Developments on Spectral Characterizations of Graphs
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
On the Eigenvalues and Energy of the Seidel and Seidel Laplacian Matrices of Graphs
Discrete Dynamics in Nature and SocietyLet SΓ be a Seidel matrix of a graph Γ of order n and let DΓ=diagn−1−2d1,n−1−2d2,…,n−1−2dn be a diagonal matrix with di denoting the degree of a vertex vi in Γ. The Seidel Laplacian matrix of Γ is defined as SLΓ=DΓ−SΓ.
J. Askari +2 more
doaj +1 more source
Combining non-negative matrix factorization with graph Laplacian regularization for predicting drug-miRNA associations based on multi-source information fusion. [PDF]
Front Pharmacol, 2023 Wang MN, Li Y, Lei LL, Ding DW, Xie XJ.
europepmc +1 more source
Controllable Intrinsic Surface Pattern Generation Using Slime Mold Simulations
Computer Graphics Forum, EarlyView.Abstract Surface‐based pattern simulations have proven valuable for texture design and scientific visualization, but existing methods face several limitations. Most simulations either target a narrow range of pattern types (e.g. spots, branching) or support a broad range of patterns at the cost of time‐consuming parameter tuning.
Jeffrey Layton +2 more
wiley +1 more source
Spectral Results on Some Hamiltonian Properties of Graphs [PDF]
Romanian Journal of Mathematics and Computer Science, 2014 Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Belardo’s interlacing theorem on the signless Laplacian eigenvalues of a graph in [6], we in this note obtain spectral conditions for some Hamiltonian ...
Rao Li
doaj
A truncated nuclear norm and graph-Laplacian regularized low-rank representation method for tumor clustering and gene selection. [PDF]
BMC Bioinformatics, 2022 Liu Q.
europepmc +1 more source