Kemeng Huang

dblp:251/2903 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
5since 2021 · last 2026
0000-0001-9147-2289ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 6 · 3 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
4 papers
Computer animation and physical simulation · 87% Geometric modeling and processing · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
contact simulation
1.822026
YASPS: A Symbolic Framework for Extensible, High-Performance IPC Simulation · ACM Trans. Graph. 2026
GIPC: Fast and Stable Gauss-Newton Optimization of IPC Barrier Energy · ACM Trans. Graph. 2024
Computer animation and physical simulation
cloth simulation
1.322026
Efficient B-Spline Finite Elements for Cloth Simulation · ACM Trans. Graph. 2026
StiffGIPC: Advancing GPU IPC for Stiff Affine-Deformable Simulation · ACM Trans. Graph. 2025
Computer animation and physical simulation
differentiable simulation
1.012026
YASPS: A Symbolic Framework for Extensible, High-Performance IPC Simulation · ACM Trans. Graph. 2026
Computer animation and physical simulation › contact simulation
incremental potential contact
1.012026
YASPS: A Symbolic Framework for Extensible, High-Performance IPC Simulation · ACM Trans. Graph. 2026
Geometric modeling and processing › shape modeling › parametric modeling
spline surfaces
1.012026
Efficient B-Spline Finite Elements for Cloth Simulation · ACM Trans. Graph. 2026
Computer animation and physical simulation
deformable body simulation
0.912025
StiffGIPC: Advancing GPU IPC for Stiff Affine-Deformable Simulation · ACM Trans. Graph. 2025
Computer animation and physical simulation › contact simulation
frictional contact
0.912025
StiffGIPC: Advancing GPU IPC for Stiff Affine-Deformable Simulation · ACM Trans. Graph. 2025
Integrated circuit design › radio-frequency circuit design
microwave filter design
0.512021
An Efficient Analysis Method for LTCC Ridge Waveguide Bandpass Filters via Database Searching · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2021

Methods — techniques the papers use, named apart from their topics

gauss-newton · 1.6symbolic differentiation · 1.0reduced integration · 1.0partial factorization · 1.0iterative solver · 1.0b-spline finite-element method · 1.0GPU kernel compilation · 1.0preconditioned conjugate gradient · 0.9multilevel additive schwarz preconditioner · 0.9hash-based reduction · 0.9transfer matrix · 0.5piecewise interpolation · 0.5database searching · 0.5
YearPublicationVenuePosition
2026 Efficient B-Spline Finite Elements for Cloth Simulation
abstract
We present an efficient B-spline finite element method (FEM) for cloth simulation. While higher-order FEM has long promised higher accuracy, its adoption in cloth simulators has been limited by its larger computational costs while generating results with similar visual quality. Our contribution is a full algorithmic pipeline that makes cloth simulation using quadratic B-spline surfaces faster than standard linear FEM in practice while consistently improving accuracy and visual fidelity. Using quadratic B-spline basis functions, we obtain a globally C 1 -continuous displacement field that supports consistent discretization of both membrane and bending energies, effectively reducing locking artifacts and mesh dependence common to linear elements. To close the performance gap, we introduce a reduced integration scheme that separately optimizes quadrature rules for membrane and bending energies, an accelerated Hessian assembly procedure tailored to the spline structure, and an optimized linear solver based on partial factorization. Together, these optimizations make high-order, smooth cloth simulation competitive at scale, yielding an average 2× speedup over linear FEM in our tests. Extensive experiments demonstrate improved accuracy, wrinkle detail, and robustness, including contact-rich scenarios, relative to linear FEM and recent higher-order approaches. Our method enables realistic wrinkling dynamics across a wide range of material parameters and supports practical garment animation, providing a new promising spatial discretization for high-quality cloth simulation.
Yuqi Meng, Yihao Shi, Kemeng Huang, Taku Komura, Yin Yang 0002, Minchen Li
ACM Trans. Graph.3
2026 YASPS: A Symbolic Framework for Extensible, High-Performance IPC Simulation
abstract
Incremental Potential Contact (IPC) has emerged as a robust and unifying formulation for contact-rich physical simulation by casting elasticity and collision handling as a single energy minimization problem. Achieving high performance, however, typically requires heavily specialized implementations that hard-code assumptions about energies, primitive types, and parameterizations, creating a major barrier to extensibility. Adding new energies or alternative parameterizations often requires re-deriving first and second-order derivatives, and implementing new assembly logic for the global Hessian and gradient. This challenge is further exacerbated by collision energies, where the same energy definition is often applied to mixed parameterizations, which can lead to a combinatorial explosion of parameterization-specific derivative and assembly cases. In this paper we introduce YASPS, a framework for physical simulation that resolves this limitation by making structural relationships explicit in a differentiable representation. YASPS introduces two relational operators, JOIN and UNION, which encode connectivity and heterogeneous parameterizations directly in the symbolic computation graph. Using symbolic differentiation over these operators, YASPS automatically derives local derivatives, and determines the induced sparsity and block structure of global gradients and Hessians from the same description while avoiding any code explosion induced by mixed-parameterizations. Targeting IPC workloads, YASPS compiles the resulting symbolic graphs into GPU kernels for local energy evaluation, derivative computation, and block-sparse matrix assembly, and solves the resulting Newton systems using a GPU-based iterative solver. This approach achieves performance competitive with state-of-the-art IPC implementations while enabling new energies and parameterizations to be added through localized symbolic definitions, without hand-written derivative or assembly code.
Kemeng Huang, Gilbert Louis Bernstein, Minchen Li, Tzumao Li
ACM Trans. Graph.2
2025 StiffGIPC: Advancing GPU IPC for Stiff Affine-Deformable Simulation
abstract
Incremental Potential Contact (IPC) is a widely used, robust, and accurate method for simulating complex frictional contact behaviors. However, achieving high efficiency remains a major challenge, particularly as material stiffness increases, which leads to slower Preconditioned Conjugate Gradient (PCG) convergence, even with state-of-the-art preconditioners. In this article, we propose a fully GPU-optimized IPC simulation framework capable of handling materials across a wide range of stiffnesses, delivering consistent high performance and scalability with up to 10× speedup over state-of-the-art GPU IPC methods. Our framework introduces three key innovations: (1) A novel connectivity-enhanced Multilevel Additive Schwarz (MAS) preconditioner on the GPU, designed to efficiently capture both stiff and soft elastodynamics and improve PCG convergence at a reduced preconditioning cost. (2) A C 2 -continuous cubic energy with an analytic eigensystem for inexact strain limiting, enabling more parallel-friendly simulations of stiff membranes, such as cloth, without membrane locking. (3) For extremely stiff behaviors where elastic waves are barely visible, we employ affine body dynamics (ABD) with a hash-based two-level reduction strategy for fast Hessian assembly and efficient affine-deformable coupling. We conduct extensive performance analyses and benchmark studies to compare our framework against state-of-the-art methods and alternative design choices. Our system consistently delivers the fastest performance across soft, stiff, and hybrid simulation scenarios, even in cases with high resolution, large deformations, and high-speed impacts.
Kemeng Huang, Huancheng Lin, Taku Komura, Minchen Li
ACM Trans. Graph.1
2024 GIPC: Fast and Stable Gauss-Newton Optimization of IPC Barrier Energy
abstract
Barrier functions are crucial for maintaining an intersection- and inversion-free simulation trajectory but existing methods, which directly use distance can restrict implementation design and performance. We present an approach to rewriting the barrier function for arriving at an efficient and robust approximation of its Hessian. The key idea is to formulate a simplicial geometric measure of contact using mesh boundary elements, from which analytic eigensystems are derived and enhanced with filtering and stiffening terms that ensure robustness with respect to the convergence of a Project-Newton solver. A further advantage of our rewriting of the barrier function is that it naturally caters to the notorious case of nearly parallel edge-edge contacts for which we also present a novel analytic eigensystem. Our approach is thus well suited for standard second-order unconstrained optimization strategies for resolving contacts, minimizing nonlinear nonconvex functions where the Hessian may be indefinite. The efficiency of our eigensystems alone yields a 3× speedup over the standard Incremental Potential Contact (IPC) barrier formulation. We further apply our analytic proxy eigensystems to produce an entirely GPU-based implementation of IPC with significant further acceleration.
Kemeng Huang, Floyd M. Chitalu, Huancheng Lin, Taku Komura
ACM Trans. Graph.1
2021 An Efficient Analysis Method for LTCC Ridge Waveguide Bandpass Filters via Database Searching
abstract
Low temperature cofired ceramic (LTCC) ridge waveguide filters are attractive candidates in implementing microwave filters in modern communication systems because of their competitive features, such as low loss, low cost, compact size, lightweight, high-power handling capability, wide spurious-free out-of-band response, and easy integration. However, optimization of LTCC ridge waveguide filters suffers from low speed or imperfect accuracy when the traditional full-wave simulation or the mode-matching method is utilized for analysis. This article makes research on an alternative analysis method based on the network theory for LTCC inline ridge waveguide filters. The method has high speed since it evaluates filter properties by simply making the cumulative product of transfer matrices of all constitutive laminated ridge waveguide (LRWG) sections and laminated coupling (LCP) sections according to their arranging sequence, and transfer matrices of all these sections are calculated from their characteristic parameters (transmission line or equivalent circuit parameters for LRWG or LCP sections) analytically. Another key feature of the method is that all characteristic parameters of LRWG and LCP sections are obtained by searching precreated database. In order to guarantee the analysis accuracy, two special strategies have been proposed and utilized. First, accurate extraction methods of characteristic parameters have been introduced and applied to the creation of a database for LRWG and LCP sections. Second, a piecewise interpolation scheme has been designed and adopted in the database searching process for both kinds of sections. The efficiency of the promoted analysis method has been verified by two analysis examples of LTCC LRWG filters. One is a three-order narrow-band filter and the other is a nine-order wide-band filter. The curves of scattering parameters calculated using the promoted method agree well with the simulated curves and the time consumed by the method is negligible when compared with the simulation time. The effectiveness of the proposed analysis method in filter design is also briefly introduced in this article.
Xinmi Yang, Xueguan Liu, Changrong Liu, Kemeng Huang
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.5
2020 A Novel Plastic Phase-Field Method for Ductile Fracture with GPU Optimization
abstract
Abstract In this paper, we articulate a novel plastic phase‐field (PPF) method that can tightly couple the phase‐field with plastic treatment to efficiently simulate ductile fracture with GPU optimization. At the theoretical level of physically‐based modeling and simulation, our PPF approach assumes the fracture sensitivity of the material increases with the plastic strain accumulation. As a result, we first develop a hardening‐related fracture toughness function towards phase‐field evolution. Second, we follow the associative flow rule and adopt a novel degraded von Mises yield criterion. In this way, we establish the tight coupling of the phase‐field and plastic treatment, with which our PPF method can present distinct elastoplasticity, necking, and fracture characteristics during ductile fracture simulation. At the numerical level towards GPU optimization, we further devise an advanced parallel framework, which takes the full advantages of hierarchical architecture. Our strategy dramatically enhances the computational efficiency of preprocessing and phase‐field evolution for our PPF with the material point method (MPM). Based on our extensive experiments on a variety of benchmarks, our novel method's performance gain can reach 1.56× speedup of the primary GPU MPM. Finally, our comprehensive simulation results have confirmed that this new PPF method can efficiently and realistically simulate complex ductile fracture phenomena in 3D interactive graphics and animation.
Zipeng Zhao, Kemeng Huang, Chen Li 0035, Changbo Wang, Hong Qin 0001
Comput. Graph. Forum2
2020 Novel hierarchical strategies for SPH-centric algorithms on GPGPU
Kemeng Huang, Zipeng Zhao, Chen Li 0035, Changbo Wang, Hong Qin 0001
Graph. Model.1