EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

JGS2-GQ: Training-free 2nd Jacobi with Gaussian Quadrature

Dewen Guo, Zixuan Lu, Zhiyong He, Yuqi Meng, Bohan Wang, Lei Lan, Weiwei Xu, Chenfanfu Jiang, Yin Yang

ACM Transactions on Graphics · 03.07.2026 · 45 (4) · 1-18

DOI: 10.1145/3811274 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Graphics, online erschienen am 03.07.2026. Verfasst von Dewen Guo und 8 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 59 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

JGS2 is a Jacobi-like GPU simulation algorithm. It avoids the overshooting issue by augmenting each subproblem with a perturbation subspace that predicts the global influence of the local solve. The efficiency of JGS2 is due to Cubature-based subspace integration at each subproblem. Being a data-driven method, Cubature requires a set of representative deformed poses that cover deformations likely to occur in the simulation. This requirement is unlikely for high-resolution deformation with rich local details. Therefore, simulation performance and convergence degenerate when Cubature extrapolates. This paper proposes a training-free subspace integration algorithm based on classic Gaussian quadrature (GQ). We leverage the fact that the subproblem's subspace bases can be well-approximated by a low-degree multivariable polynomial, which suggests GQ an excellent candidate for Cubature substitute. To this end, we introduce a novel algorithm that adaptively generates the integration region for each subproblem. As a result, GQ integration can be analytically retrieved without cumbersome data generation and training. We also show how to handle frictional contact by modifying the pre-computed perturbation subspace. The resulting JGS2-GQ framework is more versatile than the vanilla JGS2 method. It is more stable for large and novel deformations, and is free of data generation and expensive training, while maintaining a near second-order convergence that is comparable to Newton. Performance-wise, JGS2-GQ is as efficient as JGS2, which is three orders faster than classic CPU methods and up to two orders faster than classic GPU algorithms. When novel deformation occurs, JGS2-GQ outperforms JGS2 over 50%.

Zitieren

APA

Guo, D., Lu, Z., He, Z., Meng, Y., Wang, B., Lan, L., Xu, W., Jiang, C., & Yang, Y. (2026). JGS2-GQ: Training-free 2nd Jacobi with Gaussian Quadrature. ACM Transactions on Graphics, 45(4), 1-18. https://doi.org/10.1145/3811274

Vancouver

Guo D, Lu Z, He Z, Meng Y, Wang B, Lan L, et al. JGS2-GQ: Training-free 2nd Jacobi with Gaussian Quadrature. ACM Transactions on Graphics. 2026;45(4):1-18. doi:10.1145/3811274

BibTeX
@article{Guo2026,
  author = {Guo, Dewen and Lu, Zixuan and He, Zhiyong and Meng, Yuqi and Wang, Bohan and Lan, Lei and Xu, Weiwei and Jiang, Chenfanfu and Yang, Yin},
  title = {JGS2-GQ: Training-free 2nd Jacobi with Gaussian Quadrature},
  journal = {ACM Transactions on Graphics},
  year = {2026},
  volume = {45},
  number = {4},
  pages = {1--18},
  doi = {10.1145/3811274}
}
Kostenlos starten →