Zobrazeno 1 - 10
of 2 566
pro vyhledávání: '"Wang, Guoping"'
Autor:
Zhao, Yiming, Guo, Dewen, Lian, Zhouhui, Gao, Yue, Han, Jianhong, Feng, Jie, Wang, Guoping, Zhou, Bingfeng, Li, Sheng
Publikováno v:
Computational Visual Media, 2024
To bridge the gap between artists and non-specialists, we present a unified framework, Neural-Polyptych, to facilitate the creation of expansive, high-resolution paintings by seamlessly incorporating interactive hand-drawn sketches with fragments fro
Externí odkaz:
http://arxiv.org/abs/2409.19690
Accurately estimating and simulating the physical properties of objects from real-world sound recordings is of great practical importance in the fields of vision, graphics, and robotics. However, the progress in these directions has been limited -- p
Externí odkaz:
http://arxiv.org/abs/2409.13486
The discrete Laplacian operator holds a crucial role in 3D geometry processing, yet it is still challenging to define it on point clouds. Previous works mainly focused on constructing a local triangulation around each point to approximate the underly
Externí odkaz:
http://arxiv.org/abs/2409.06506
Recently, the 3D Gaussian Splatting (3D-GS) method has achieved great success in novel view synthesis, providing real-time rendering while ensuring high-quality rendering results. However, this method faces challenges in modeling specular reflections
Externí odkaz:
http://arxiv.org/abs/2409.05868
Publikováno v:
ACM Transactions on Graphics, Vol. 43, No. 6, Article 225, 2024
We propose a GPU-based iterative method for accelerated elastodynamic simulation with the log-barrier-based contact model. While Newton's method is a conventional choice for solving the interior-point system, the presence of ill-conditioned log barri
Externí odkaz:
http://arxiv.org/abs/2407.00046
In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also determine the graphs whose spectral radius and distance spectral radius a
Externí odkaz:
http://arxiv.org/abs/2405.19999
We present GeGnn, a learning-based method for computing the approximate geodesic distance between two arbitrary points on discrete polyhedra surfaces with constant time complexity after fast precomputation. Previous relevant methods either focus on c
Externí odkaz:
http://arxiv.org/abs/2309.05613
Autor:
Zheng, Zhongtian, Gao, Xifeng, Pan, Zherong, Li, Wei, Wang, Peng-Shuai, Wang, Guoping, Wu, Kui
Mesh repair is a long-standing challenge in computer graphics and related fields. Converting defective meshes into watertight manifold meshes can greatly benefit downstream applications such as geometric processing, simulation, fabrication, learning,
Externí odkaz:
http://arxiv.org/abs/2309.00134
The least eigenvalue of a graph $G$ is the least eigenvalue of adjacency matrix of $G$. In this paper we determine the graphs which attain the minimum least eigenvalue among all complements of connected simple graphs with given connectivity.
Com
Com
Externí odkaz:
http://arxiv.org/abs/2305.17143
Suppose $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d_G( v_i,v_j ) $ be the least distance between $v_i$ and $v_j$ in $G$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} ) _{n\times n}$, where
Externí odkaz:
http://arxiv.org/abs/2302.13761