Zixuan Li, Pengfei Shen, Hanxiao Sun, Zibo Zhang, Yu Guo, Ligang Liu, Lingqi Yan, Steve Marschner, Miloš Hašan, Beibei Wang
{"title":"Erratum: Fiber-level Woven Fabric Capture from a Single Microscopic Image","authors":"Zixuan Li, Pengfei Shen, Hanxiao Sun, Zibo Zhang, Yu Guo, Ligang Liu, Lingqi Yan, Steve Marschner, Miloš Hašan, Beibei Wang","doi":"10.1145/3839118","DOIUrl":"https://doi.org/10.1145/3839118","url":null,"abstract":"This is an erratum for the article “Fiber-level Woven Fabric Capture from a Single Microscopic Image” published in ACM Trans. Graph. 45, 5, Article 43 (June 2026), 18 pages.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"12 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148815521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ruilin Ye, Yijun Zhou, Jianwei Zeng, Chen Dai, Wenqing Hong, Wenwen Li, Jun Zhao, Feihu Xu
{"title":"Erratum: Thermal Non-Line-of-Sight Imaging through Rough Surfaces","authors":"Ruilin Ye, Yijun Zhou, Jianwei Zeng, Chen Dai, Wenqing Hong, Wenwen Li, Jun Zhao, Feihu Xu","doi":"10.1145/3839113","DOIUrl":"https://doi.org/10.1145/3839113","url":null,"abstract":"This is an erratum for the article “Thermal Non-Line-of-Sight Imaging through Rough Surfaces” published in ACM Trans. Graph. 45, 5, Article 41 (June 2026), 21 pages.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"67 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148815517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Erratum: Robust and Efficient Penetration-Free Elastodynamics without Barriers","authors":"Juntian Zheng, Zhaofeng Luo, Minchen Li","doi":"10.1145/3839111","DOIUrl":"https://doi.org/10.1145/3839111","url":null,"abstract":"This is an erratum for the article “Robust and Efficient Penetration-Free Elastodynamics without Barriers” published in ACM Trans. Graph. 45, 5, Article 40 (June 2026), 20 pages.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"36 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148815519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yuanzhe He, Yutao Zheng, Shijie Xu, Ning Liu, Yingzheng Liu, Weiwei Cai
{"title":"Erratum: Tensor Decomposition-Based Four-dimensional Background-Oriented Schlieren Tomography for High-Speed, High-Fidelity Flow Field Reconstruction","authors":"Yuanzhe He, Yutao Zheng, Shijie Xu, Ning Liu, Yingzheng Liu, Weiwei Cai","doi":"10.1145/3839104","DOIUrl":"https://doi.org/10.1145/3839104","url":null,"abstract":"This is an erratum for the article “Tensor Decomposition-Based Four-Dimensional Background-Oriented Schlieren Tomography for High-Speed, High-Fidelity Flow Field Reconstruction” published in ACM Trans. Graph. 45, 5, Article 35 (June 2026), 19 pages.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"9 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148815520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Erratum: A Robust and Efficient Intersection Algorithm for NURBS Surfaces: Handling Small Loops and Tangent Intersections","authors":"Jieyin Yang, Xiaohong Jia","doi":"10.1145/3839108","DOIUrl":"https://doi.org/10.1145/3839108","url":null,"abstract":"This is an erratum for the article “A Robust and Efficient Intersection Algorithm for NURBS Surfaces: Handling Small Loops and Tangent Intersections” published in ACM Trans. Graph. 45, 5, Article 37 (June 2026), 19 pages.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"40 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148815537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Kenny Jones, Paul Guerrero, Niloy Mitra, Daniel Ritchie
{"title":"ShapeLib: Designing a library of programmatic 3D shape abstractions with Large Language Models","authors":"R. Kenny Jones, Paul Guerrero, Niloy Mitra, Daniel Ritchie","doi":"10.1145/3840293","DOIUrl":"https://doi.org/10.1145/3840293","url":null,"abstract":"We present <jats:italic toggle=\"yes\">ShapeLib</jats:italic> , the first method that uses the priors of Large Language Models (LLMs) to design libraries of programmatic 3D shape abstractions. Our system accepts two forms of user-provided design intent: high-level text descriptions of functions to include in the output library and a small seed set of exemplar shapes. We discover a library of abstractions that matches this design intent with a guided LLM workflow that first <jats:italic toggle=\"yes\">proposes</jats:italic> different ways of applying and implementing functions, and then <jats:italic toggle=\"yes\">validates</jats:italic> these functions are helpful in representing seed set shapes. To extend beyond the seed set, we develop library-specific recognition networks that map shapes (represented as primitives, voxels, or point clouds) to programs that use these newly discovered abstractions. Across multiple modeling domains (split by shape category), we find that LLMs, when thoughtfully combined with geometric reasoning, can be guided to author libraries of abstraction functions that generalize across shape distributions. Our framework takes a step towards realizing the long-standing shape analysis aspiration of discovering reusable, programmatic shape abstractions while exposing interpretable, semantically aligned interfaces. Our extensive evaluation demonstrates that ShapeLib provides distinct advantages over prior alternative abstraction discovery works in terms of generalization, usability, and maintaining plausibility under manipulation. Finally, we demonstrate that ShapeLib’s abstraction functions unlock a number of downstream applications, combining LLM reasoning over shape programs with geometry processing tools to support shape editing and generation workflows.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"27 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148768642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yu Xing, Xiaoxuan Wang, Zherong Pan, Xifeng Gao, Lin Lu
{"title":"Worst-Case Non-parametric Shape Optimization","authors":"Yu Xing, Xiaoxuan Wang, Zherong Pan, Xifeng Gao, Lin Lu","doi":"10.1145/3841629","DOIUrl":"https://doi.org/10.1145/3841629","url":null,"abstract":"The advancements in low-cost manufacturing hardware have enabled inexperienced users to create 3D product prototypes in-house. As a common issue, however, the resulting 3D models, despite their aesthetic appeal, often lack the structural integrity required for practical use. While there has been significant research into automated shape adjustment techniques, these methods rely on additional inputs such as parametric representations and specific external load conditions, making them inaccessible to novice users. To address this challenge, we propose a shape optimization technique that does not require extra inputs. Starting from a target shape represented by a general 3D mesh, our method aims to produce an optimized shape that is both visually consistent and structurally more robust. Our approach formulates the problem as an approximate bilevel optimization: the inner problem solves a compliance-based surrogate to identify a critical load direction, while the outer problem minimizes the maximum stress across the entire shape surface. We develop an approximate bilevel solver that alternates between solving the outer and inner problems, as well as regular mesh refinement. Our empirical results demonstrate the effectiveness of our method in finding 3D shapes that are visually consistent, while also providing the necessary robustness for practical applications.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"25 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148729064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Gauge Equivariant Capsule Networks","authors":"Lisha Wang, Wenrui Dai, Junni Zou, Ziyang Zheng, Shaohui Li, Chenglin Li, Hongkai Xiong","doi":"10.1145/3840283","DOIUrl":"https://doi.org/10.1145/3840283","url":null,"abstract":"Gauge equivariant networks are emerging for equivariant representation learning on manifolds. However, existing gauge equivariant networks suffer from the dilemma between restricted SO(2) irreducible representations with equivariance guarantee to arbitrary continuous gauge transformations and enhanced <jats:italic toggle=\"yes\"> C <jats:sub>N</jats:sub> </jats:italic> regular representations with limited equivariance to finite discretized gauge transformations. In this paper, we propose a gauge equivariant capsule network (GECN) for manifolds that guarantees mathematically provable gauge equivariance in SO(2) without sacrificing the expressive capability. We develop a novel gauge equivariant capsule (GEC) that leverages the spatio-capsule dynamic routing algorithm to jointly exploit the capsule-wise and spatial dependencies in a local region of manifolds and achieve gauge equivariant representation based on real irreducible representations of SO(2). Furthermore, we propose a gauge equivariant capsule network (GECN) for manifolds by designing initial pose extractor, GEC-based residual block, and gauge equivariant pooling and unpooling based on GECs. We show that GECN is general to unify existing gauge equivariant networks and demonstrate in theory that it is equivariant to continuous gauge transformations in SO(2). Experimental results demonstrate that GECN achieves state-of-the-art performance in the tasks of deformable shape classification and segmentation and classification of spherical image and 3-D objects without principal curvature direction.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"17 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148728117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Energy-Controllable Time Integration for Elastodynamic Contact","authors":"Kevin You, Juntian Zheng, Minchen Li","doi":"10.1145/3840297","DOIUrl":"https://doi.org/10.1145/3840297","url":null,"abstract":"Dynamic simulation of elastic bodies is a longstanding task in engineering and computer graphics. In graphics, numerical integrators like implicit Euler and BDF2 are preferred due to their stability at large time steps, but they tend to dissipate energy uncontrollably. In contrast, symplectic methods like implicit midpoint can conserve energy but are not unconditionally stable and fail on moderately stiff problems. To address these limitations, we propose a general class of numerical integrators for Hamiltonian problems which are symplectic on linear problems, yet have superior stability on nonlinear problems. With this, we derive a novel energy-controllable time integrator, A-search, a simple modification of implicit Euler that can follow user-specified energy targets, enabling flexible control over energy dissipation or conservation while maintaining stability and physical fidelity. Our method integrates seamlessly with barrier-type energies and allows for inversion-free and penetration-free guarantees, making it well-suited for handling large deformations and complex collisions. Extensive evaluations over a wide range of material parameters and scenes demonstrate that A-search has biases to keep energy in low frequency motion rather than dissipation, and A-search outperforms traditional methods such as BDF2 at similar total running times by maintaining energy and leading to more visually desirable simulations.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"44 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148709532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Julius Ikkala, Pekka Jääskeläinen, Markku Mäkitalo
{"title":"RCPG: Real-Time Product Path Guiding Using Radiance Cascades","authors":"Julius Ikkala, Pekka Jääskeläinen, Markku Mäkitalo","doi":"10.1145/3840291","DOIUrl":"https://doi.org/10.1145/3840291","url":null,"abstract":"We present Radiance Cascade Path Guiding (RCPG), a real-time product path guiding method that improves upon previous state-of-the-art real-time path guiding methods both in quality and performance. We derive bounds for radiance intervals such that the direction of incoming light is not misrepresented by radiance cascades. This allows us to take advantage of the hierarchical nature of radiance cascades in a sampling process that takes the product of the incoming radiance and the material’s BSDF into account. It is also possible to compute the probability distribution function of RCPG sampling for any given direction, making it readily compatible with other sampling methods, such as multiple importance sampling (MIS) and unbiased ReSTIR. As a product sampling scheme, RCPG can use a single sampling method for producing scattering directions, as opposed to needing separate importance sampling schemes for incident radiance and the BSDF. Compared to prior state-of-the-art real-time path guiding methods utilizing multi-sample MIS, this allows RCPG to generally trace twice as many paths per pixel within a real-time frame rate. Because the data structure is defined in world space, it can be used to generate samples starting from off-screen path vertices, which is necessary for effective multi-bounce path guiding.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"1 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148709531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}