Xuehui Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xuehui Liu has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Enhua Wu
Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
5 shared publications - Baoquan Liu
Department of Computer Science and Technology, University of Bedfordshire
1 shared publication Di Wu
1 shared publicationE.H. Wu
Department of Computer and Information Science, Faculty of Science and Technology, University of Macau, Macao, China
1 shared publicationHao He
1 shared publication- Hongbin Zhu
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 1 April 2024
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 36 (4) , 533-542
Virtual Fiber-Based Constitute Model for Anisotropic Material Design
In order to expand types of anisotropic hyperelastic virtual materials for elastic bodies simulation in graphics, this paper established a virtual fiber-based constitutive model. Firstly, the strain energy density function of hyperelastic body was decomposed into fiber addition form of axial, shearing and volumetric component based on energy additivity. Secondly, strain measurement of each component for a single fiber was established. Finally, stress expression of each component was deduced. Simulation experiments used tetrahedral nonlinear finite element method (FEM), semi-implicit time integration and CPU-based serial algorithm to test effects of nonlinear energy function and fiber weight combination on the stiffness, Poisson effect and anisotropic axial characteristics in different scenarios. Results show that the virtual fiber-based model displays desirable physical properties with adopted parameter setting, and is suitable for large deformation simulation. Compared with existing transverse isotropic model, this model also possesses more abundant adjustability.
- 1 April 2024
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 36 (4) , 533-542
Open AccessVirtual Fiber-Based Constitute Model for Anisotropic Material Design
In order to expand types of anisotropic hyperelastic virtual materials for elastic bodies simulation in graphics, this paper established a virtual fiber-based constitutive model. Firstly, the strain energy density function of hyperelastic body was decomposed into fiber addition form of axial, shearing and volumetric component based on energy additivity. Secondly, strain measurement of each component for a single fiber was established. Finally, stress expression of each component was deduced. Simulation experiments used tetrahedral nonlinear finite element method (FEM), semi-implicit time integration and CPU-based serial algorithm to test effects of nonlinear energy function and fiber weight combination on the stiffness, Poisson effect and anisotropic axial characteristics in different scenarios. Results show that the virtual fiber-based model displays desirable physical properties with adopted parameter setting, and is suitable for large deformation simulation. Compared with existing transverse isotropic model, this model also possesses more abundant adjustability.
- 28 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 30 (8) , 4601-4614
Projective Peridynamic Modeling of Hyperelastic Membranes With Contact
Real-time simulation of hyperelastic membranes like cloth still faces a lot of challenges, such as hyperplasticity modeling and contact handling. In this study, we propose projective peridynamics that uses a local-global strategy to enable fast and robust simulation of hyperelastic membranes with contact. In the global step, we propose a semi-implicit strategy to linearize the governing equation for hyperelastic materials that are modeled with peridynamics. By decomposing the first Piola-Kirchhoff stress tensor into a positive and a negative part, successive substitutions can be taken to solve the nonlinear problems. Convergence is guaranteed by further addressing the overshooting problem. Since our global step solve requires no energy summation and dot product operations over the entire problem, it fits into GPU implementation perfectly. In the local step, we further present a GPU-friendly gradient descent method to prevent interpenetration by solving an optimization problem independently. Putting the global and local solves together, experiments show that our method is robust and efficient in simulating complex models of membranes involving hyperelastic materials and contact.
- 28 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 30 (8) , 4601-4614
Projective Peridynamic Modeling of Hyperelastic Membranes With Contact
Real-time simulation of hyperelastic membranes like cloth still faces a lot of challenges, such as hyperplasticity modeling and contact handling. In this study, we propose projective peridynamics that uses a local-global strategy to enable fast and robust simulation of hyperelastic membranes with contact. In the global step, we propose a semi-implicit strategy to linearize the governing equation for hyperelastic materials that are modeled with peridynamics. By decomposing the first Piola-Kirchhoff stress tensor into a positive and a negative part, successive substitutions can be taken to solve the nonlinear problems. Convergence is guaranteed by further addressing the overshooting problem. Since our global step solve requires no energy summation and dot product operations over the entire problem, it fits into GPU implementation perfectly. In the local step, we further present a GPU-friendly gradient descent method to prevent interpenetration by solving an optimization problem independently. Putting the global and local solves together, experiments show that our method is robust and efficient in simulating complex models of membranes involving hyperelastic materials and contact.
- 3 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 22 (8) , 1973-1986
Multiphase Interface Tracking with Fast Semi-Lagrangian Contouring
We propose a semi-Lagrangian method for multiphase interface tracking. In contrast to previous methods, our method maintains an explicit polygonal mesh, which is reconstructed from an unsigned distance function and an indicator function, to track the interface of arbitrary number of phases. The surface mesh is reconstructed at each step using an efficient multiphase polygonization procedure with precomputed stencils while the distance and indicator function are updated with an accurate semi-Lagrangian path tracing from the meshes of the last step. Furthermore, we provide an adaptive data structure, multiphase distance tree, to accelerate the updating of both the distance function and the indicator function. In addition, the adaptive structure also enables us to contour the distance tree accurately with simple bisection techniques. The major advantage of our method is that it can easily handle topological changes without ambiguities and preserve both the sharp features and the volume well. We will evaluate its efficiency, accuracy and robustness in the results part with several examples.
- 3 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 22 (8) , 1973-1986
Multiphase Interface Tracking with Fast Semi-Lagrangian Contouring
We propose a semi-Lagrangian method for multiphase interface tracking. In contrast to previous methods, our method maintains an explicit polygonal mesh, which is reconstructed from an unsigned distance function and an indicator function, to track the interface of arbitrary number of phases. The surface mesh is reconstructed at each step using an efficient multiphase polygonization procedure with precomputed stencils while the distance and indicator function are updated with an accurate semi-Lagrangian path tracing from the meshes of the last step. Furthermore, we provide an adaptive data structure, multiphase distance tree, to accelerate the updating of both the distance function and the indicator function. In addition, the adaptive structure also enables us to contour the distance tree accurately with simple bisection techniques. The major advantage of our method is that it can easily handle topological changes without ambiguities and preserve both the sharp features and the volume well. We will evaluate its efficiency, accuracy and robustness in the results part with several examples.
- 8 April 2010
- Published by Springer Nature in The Visual Computer
- Vol. 26 (6-8) , 445-455
Real-time coherent stylization for augmented reality
- 8 April 2010
- Published by Springer Nature in The Visual Computer
- Vol. 26 (6-8) , 445-455
Real-time coherent stylization for augmented reality
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 04,p. 276-281
Variable Code-Mode Based Connectivity Compression for Triangular Meshes
In this article, we present an efficient algorithm for encoding the connectivity information of triangular meshes. By the method, all triangles are traversed first to obtain operator series. Then an arithmetic coder based on variable code-mode is applied to encode the operator series. According to the operator last encoded, the property of triangular mesh and the method of mesh traversal, a code-mode is calculated for each operator being encoded currently, where the operator with higher prediction probability is given a shorter binary strand. Then we can obtain the binary strand according to its code-mode and encode every bit of this binary strand by adaptive arithmetic coding method. Testing result shows that the compression ratio of our algorithm is very high and even higher than the compression ratio by using TG algorithm, which is commonly regarded as one of the best in terms of compression ratio.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 04,p. 276-281
Variable Code-Mode Based Connectivity Compression for Triangular Meshes
In this article, we present an efficient algorithm for encoding the connectivity information of triangular meshes. By the method, all triangles are traversed first to obtain operator series. Then an arithmetic coder based on variable code-mode is applied to encode the operator series. According to the operator last encoded, the property of triangular mesh and the method of mesh traversal, a code-mode is calculated for each operator being encoded currently, where the operator with higher prediction probability is given a shorter binary strand. Then we can obtain the binary strand according to its code-mode and encode every bit of this binary strand by adaptive arithmetic coding method. Testing result shows that the compression ratio of our algorithm is very high and even higher than the compression ratio by using TG algorithm, which is commonly regarded as one of the best in terms of compression ratio.
- 1 July 2006
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 7 (7) , 1210-1214
Curvature detail representation of triangular surfaces
Curvature tells much about details of surfaces and is studied widely by researchers in the computer graphics com- munity. In this paper, we first explain the mean-curvature view of Dirichlet energy of triangular surfaces and introduce a curvature representation of details, and then present surfaces editing applications based on their curvature representation. We apply our method to surfaces with complex boundaries and rich details. Results show the validity and robustness of our method and dem- onstrate curvature map can be a helpful surfaces detail representation.
- 1 July 2006
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 7 (7) , 1210-1214
Curvature detail representation of triangular surfaces
Curvature tells much about details of surfaces and is studied widely by researchers in the computer graphics com- munity. In this paper, we first explain the mean-curvature view of Dirichlet energy of triangular surfaces and introduce a curvature representation of details, and then present surfaces editing applications based on their curvature representation. We apply our method to surfaces with complex boundaries and rich details. Results show the validity and robustness of our method and dem- onstrate curvature map can be a helpful surfaces detail representation.
- 9 May 2006
- Published by Springer Nature in The Visual Computer
- Vol. 22 (6) , 424-433
View-dependent refinement of multiresolution meshes using programmable graphics hardware
- 9 May 2006
- Published by Springer Nature in The Visual Computer
- Vol. 22 (6) , 424-433
View-dependent refinement of multiresolution meshes using programmable graphics hardware
- 24 August 2005
- Published by Springer Nature in The Visual Computer
- Vol. 21 (8-10) , 727-734
Real-time simulation of physically based on-surface flow
- 24 August 2005
- Published by Springer Nature in The Visual Computer
- Vol. 21 (8-10) , 727-734
Real-time simulation of physically based on-surface flow