ACM Transactions on Graphics最新文献_第7页

Stress-Aware Panelization of Freeform Surfaces 自由曲面的应力感知面板化

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811387

Xinzhuo Hu, Roi Poranne, Julian Panetta

{"title":"Stress-Aware Panelization of Freeform Surfaces","authors":"Xinzhuo Hu, Roi Poranne, Julian Panetta","doi":"10.1145/3811387","DOIUrl":"https://doi.org/10.1145/3811387","url":null,"abstract":"Freeform surfaces are popular in architectural design for their expressive aesthetics, yet they remain challenging to fabricate. A common strategy is to approximate them with assemblies of planar polygonal panels in a process we term panelization, enabling cost-effective fabrication from sheet materials such as wood, metal, or glass. Our goal is to compute panelizations that are both geometrically faithful and structurally robust. A two-stage pipeline, i.e. geometric panelization followed by structural optimization, can be effective, but joint optimization may yield better outcomes by letting mechanics influence the panelization itself. The challenges are that the panelization task is inherently combinatorial, and structural objectives depend on stresses that have a complex, global dependence on the geometry and are costly to evaluate. Moreover, improving structural performance must be balanced against preserving the input surface's design intent. To address these challenges, we formulate panelization as a continuous surface flow coupled to stress analysis, by modeling candidates as creased elastic shells. We define a global objective by integrating an arbitrary function of stress over the shell and derive efficient gradients with respect to the surface shape to enable optimization. We further introduce flow terms that better preserve the input shape and show that running BFGS in a Sobolev space substantially outperforms standard BFGS and Sobolev gradient descent. We evaluate our method on architectural models, showing that incorporating stress during panelization yields substantial stress reductions and more robust designs compared to optimizing stress after fixing the panelization.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"25 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148371925","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}

引用次数: 0

Mechanical Cloaking of Halftoned Imagery 半色调图像的机械隐形

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811394

Jonàs Martínez, Brisard Sébastien, Kostas Danas, Eric Garner, Siddhant Kumar, Sylvain Lefebvre

引用次数: 0

Efficient B-Spline Finite Elements for Cloth Simulation 布料仿真的高效b样条有限元

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811278

Yuqi Meng, Yihao Shi, Kemeng Huang, Zixuan Lu, Ning Guo, Taku Komura, Yin Yang, Minchen Li

{"title":"Efficient B-Spline Finite Elements for Cloth Simulation","authors":"Yuqi Meng, Yihao Shi, Kemeng Huang, Zixuan Lu, Ning Guo, Taku Komura, Yin Yang, Minchen Li","doi":"10.1145/3811278","DOIUrl":"https://doi.org/10.1145/3811278","url":null,"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.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"13 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148371934","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}

引用次数: 0

Better Bending: Analysis, Construction and Verification of Discrete Bending Models for Kirchhoff-Love Shells 更好的弯曲：Kirchhoff-Love壳离散弯曲模型的分析、构建和验证

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811373

Zhen Chen, Danny Kaufman, Etienne Vouga

{"title":"Better Bending: Analysis, Construction and Verification of Discrete Bending Models for Kirchhoff-Love Shells","authors":"Zhen Chen, Danny Kaufman, Etienne Vouga","doi":"10.1145/3811373","DOIUrl":"https://doi.org/10.1145/3811373","url":null,"abstract":"While thin shells have ubiquitous applications and have been studied inside and outside computer graphics for decades, there is little consensus on how to best discretize them. We systematically study models for simulating bending of Kirchhoff-Love shells, with the goal of making practical recommendations, backed by careful numerical experiments, of when and how these models should be used. We analyze ten of the most popular discrete bending models in computer graphics for thin-shell simulation, along with new variants that we propose ourselves. We first verify all models on an analytic test benchmark to probe convergence under refinement and mesh-dependence, and then stress-test with a second benchmark that considers behavior at sharp bends. Finally, we test benchmark leaders on a practical suite of challenging large-scale equilibrium and dynamic shell modeling problems, analyzing both full solution behavior and comparative compute costs. We identify leading existing models and their tradeoffs in terms of accuracy and performance. During this analysis we also identify some issues and modeling gaps in the best-performing discrete bending models. We construct new energy model variants to address some of these gaps, as well as formulas and algorithmic tools for their practical simulation, and finally recommend best practices for modeling thin-shell bending.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"36 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148371938","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}

引用次数: 0

SCom DAG: compact representation of spatial data for real-time rendering com DAG：用于实时渲染的空间数据的紧凑表示

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811365

Albert Garifullin, Nikolay Mayorov, Eduard Hauer, Alexey Voloboy, Vladimir Frolov

{"title":"SCom DAG: compact representation of spatial data for real-time rendering","authors":"Albert Garifullin, Nikolay Mayorov, Eduard Hauer, Alexey Voloboy, Vladimir Frolov","doi":"10.1145/3811365","DOIUrl":"https://doi.org/10.1145/3811365","url":null,"abstract":"We developed a new data structure for the efficient representation of spatial data, called SCom DAG — Similarity Compressed Directed Acyclic Graph. It subdivides space with an octree and utilizes local data similarities and topology for compact encoding. Our method exploits the fact that many surface and volume areas are similar to each other up to a transformation. We store spatial transformations on the edges of the graph and data transformations on terminal links pointing to data blocks. Compression is achieved mainly by reducing the number of graph nodes and data blocks while maintaining the same number of paths in the graph. Spatial transformations are compact due to the use of hyper-octahedral groups that are relatively small even in 4D space. SCom DAG works with data of different dimensionality, such as 2D textures, 3D meshes and 4D time-varying volumetric data. Thus, it is well suited for volumetric data visualization and rendering large scenes. The proposed algorithm performs lossy compression, creating a compact representation of various data with controlled quality, which is especially valuable for low-end devices and convenient browser use. It provides a balance of compression and quality comparable to state-of-the-art technologies in various domains, such as compact texture and geometry representation, volumetric data, radiance fields, and precomputed 4D volume animations. At the same time, our data structure enables fast sampling and real-time ray tracing, and its hierarchical nature allows for rendering with a continuous level of detail.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"41 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148371988","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}

引用次数: 0

Uniformly Deployable Kirigami on Arbitrary Planar Graphs 任意平面图上的可均匀展开基里伽米

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811326

Aviv Segall, Jing Ren, Olga Sorkine-Hornung

{"title":"Uniformly Deployable Kirigami on Arbitrary Planar Graphs","authors":"Aviv Segall, Jing Ren, Olga Sorkine-Hornung","doi":"10.1145/3811326","DOIUrl":"https://doi.org/10.1145/3811326","url":null,"abstract":"We present an analytical framework for exploring the design space of hinged kirigami structures that deploy rigidly and uniformly. A hinged kirigami structure consists of rigid planar faces connected by hinges, and is deployable if the faces can rotate about the hinges without deformation. Such deployability depends on both the topology and the geometry, i.e., the combinatorial connectivity of the faces and their spatial embedding. Prior work studies geometric constraints for uniform deployability in restricted settings, most notably quadrilateral kirigami patterns and structures derived from 2-colorable planar graphs. However, existing analysis does not readily generalize to arbitrary kirigami structures, nor does it provide a systematic approach for constructing deployable kirigami from non-2-colorable planar graphs (e.g., graphs with non-manifold embeddings). Moreover, while geometric conditions for deployability have been partially investigated, the structure of the full deployable design space and its associated degrees of freedom remain largely unexplored. In this work, we propose a new framework that enables the derivation of hinged kirigami structures from arbitrary planar graphs, with the key feature that multiple distinct kirigami structures can be generated from the same graph. We derive geometric constraints that ensure uniform rigid deployability and analytically characterize the full design space of deployable embeddings, including its associated degrees of freedom. This characterization allows continuous navigation of the design space and provides a systematic foundation for the design of kirigami-based mechanical metamaterials.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"17 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372007","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}

引用次数: 0

Structural MAT: Clean and Scalable Medial Axis Simplification via Explicit Surface Correspondence 结构MAT：通过显式表面对应的清洁和可伸缩的中轴简化

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811291

Pengfei Wang, Shuangmin Chen, Dongming Yan, Ying He, Shiqing Xin, Changhe Tu, Wenping Wang

{"title":"Structural MAT: Clean and Scalable Medial Axis Simplification via Explicit Surface Correspondence","authors":"Pengfei Wang, Shuangmin Chen, Dongming Yan, Ying He, Shiqing Xin, Changhe Tu, Wenping Wang","doi":"10.1145/3811291","DOIUrl":"https://doi.org/10.1145/3811291","url":null,"abstract":"The Medial Axis Transform (MAT) is a complete shape descriptor capable of reconstructing the geometry of the original domain. A high-quality MAT should not only facilitate high-fidelity reconstruction but also capture structural features—for instance, by aligning the MAT boundary with the locus of rolling ball centers within fillet regions. However, computing such an ideal MAT remains a significant challenge, particularly when the input is a discrete triangle mesh. In this paper, we follow the established technical pipeline of initializing the MAT via a 3D Voronoi diagram of surface samples and subsequently simplifying the Voronoi structure through a QEM-like scheme. Our key insight is to explicitly track the correspondence between MAT vertices and surface regions throughout the progressive simplification process, ensuring that the resulting MAT triangles accurately reflect the intrinsic symmetries between surface patches. We translate these geometric requirements into a suite of priority control strategies that govern the sequencing of edge collapses. Through extensive evaluation against state-of-the-art MAT algorithms, we validate the strong performance of our approach regarding runtime efficiency, structural alignment, boundary regularity, triangle quality, and robustness to noise. Our resulting MATs remain highly expressive for both articulated shapes and CAD models, even under extreme simplification—effectively capturing the global structure of complex geometries with only a few hundred vertices. Finally, we showcase the utility of our approach through two potential applications: capturing the locus of rolling ball centers within fillet regions, a structural capability not previously demonstrated in the existing literature, and surface extraction from unsigned distance fields, where the medial axis of the є -isosurface naturally yields a clean single-layer result. Source code is available at https://github.com/sssomeone/structural-mat.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"9 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372036","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}

引用次数: 0

Role-Aware Virtual Agents for Navigational Interaction guided by a Multimodal Large Language Model 基于多模态大语言模型的导航交互角色感知虚拟代理

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811319

Minyoung Kim, Changyang Li, Cuong Nguyen, Lap-Fai Yu

引用次数: 0

ACT: A Unified Framework for Rigging and Animating Characters with Arbitrary Topologies 一个统一的框架，用于任意拓扑的操纵和动画角色

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811392

Pengyu Long, Weirui Wang, Qingcheng Zhao, Xiaoyang Guo, Xiaoyu Pan, Qixuan Zhang, Jiaqing Zhou, Tianlei Hu, Wei Yang, Lan Xu, Jingyi Yu

{"title":"ACT: A Unified Framework for Rigging and Animating Characters with Arbitrary Topologies","authors":"Pengyu Long, Weirui Wang, Qingcheng Zhao, Xiaoyang Guo, Xiaoyu Pan, Qixuan Zhang, Jiaqing Zhou, Tianlei Hu, Wei Yang, Lan Xu, Jingyi Yu","doi":"10.1145/3811392","DOIUrl":"https://doi.org/10.1145/3811392","url":null,"abstract":"Recent advances in generative models have democratized the creation of high-quality static 3D assets, yet animating these meshes remains a labor-intensive bottleneck. Traditional pipelines fracture this process into sequential stages—rigging, skinning, and motion synthesis—ignoring the inherent coupling between morphological structure and motor function. To bridge this gap, we introduce ACT, a unified generative framework that reformulates rigging and animation not as independent tasks, but as complementary views of a single hyper-kinematic process. Our key insight is to model the joint distribution of skeletal topology and temporal motion within a shared latent space. ACT utilizes a Vision Language Model (VLM) to extract semantic topological priors from arbitrary meshes, which then condition a Diffusion Transformer (DiT) backbone. By treating static rest poses and dynamic trajectories as a unified sequence, our model employs a task-aware masking strategy to flexibly perform zero-shot rigging, text-guided motion generation, and motion completion within a single end-to-end architecture. Furthermore, a geometry-guided decoder ensures that surface deformations are tightly coupled with the generated kinematics. Extensive experiments demonstrate that ACT generalizes robustly to diverse, non-humanoid characters without retraining. By replacing brittle cascaded pipelines with a holistic prior, our method enables novel applications such as semantic-driven topology editing and generative in-betweening, offering a versatile and efficient solution for automating 3D character animation.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"17 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372280","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}

引用次数: 0

M-ABD: Scalable, Efficient, and Robust Multi-Affine-Body Dynamics M-ABD：可扩展、高效和鲁棒的多仿射体动力学

IF 6.2 1区计算机科学

ACM Transactions on Graphics Pub Date : 2026-07-03 DOI: 10.1145/3811276

Zhiyong He, Dewen Guo, Minghao Guo, Yili Zhao, Wojciech Matusik, Hao Su, Chenfanfu Jiang, Peter Yichen Chen, Yin Yang

{"title":"M-ABD: Scalable, Efficient, and Robust Multi-Affine-Body Dynamics","authors":"Zhiyong He, Dewen Guo, Minghao Guo, Yili Zhao, Wojciech Matusik, Hao Su, Chenfanfu Jiang, Peter Yichen Chen, Yin Yang","doi":"10.1145/3811276","DOIUrl":"https://doi.org/10.1145/3811276","url":null,"abstract":"Simulating large-scale articulated assemblies poses a significant challenge due to the numerical stiffness and geometric complexity of jointed structures. Conventional rigid body solvers struggle with the high nonlinearity induced by rotation parameterization. This difficulty becomes more pronounced for multiple two-way-coupled bodies. This paper introduces a novel framework that leverages the linear kinematic mapping of Affine Body Dynamics (ABD). As ABD targets near-rigid objects, the constitutive variations of different materials become negligible, which justifies a co-rotational approach to isolate geometric nonlinearities of the system. This insight enables the use of constant system matrices that can be pre-factorized throughout the simulation, even with fully implicit integration schemes. To manage the high DOF counts of large-scale systems, we map primal body coordinates onto a compact dual space defined by minimal joint degrees of freedom. By solving the resulting KKT systems, our method ensures exact constraint enforcement and physically accurate motion propagation. We provide a suite of specialized solvers tailored for diverse joint topologies, including chains, trees, closed loops, and irregular networks. Experimental results show that our approach achieves interactive rates for systems with hundreds of thousands of bodies on a single CPU core, while maintaining excellent stability at large time steps.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"16 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372281","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}

引用次数: 0