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

DissolveStereo: Coarse Depth Injection for Zero-Shot Stereo Video Generation DissolveStereo：用于零镜头立体视频生成的粗深度注入

IF 6.2 1区计算机科学

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

Jian Shi, Qian Wang, Zhenyu Li, Wenqing Cui, Ramzi Idoughi, Peter Wonka

{"title":"DissolveStereo: Coarse Depth Injection for Zero-Shot Stereo Video Generation","authors":"Jian Shi, Qian Wang, Zhenyu Li, Wenqing Cui, Ramzi Idoughi, Peter Wonka","doi":"10.1145/3811390","DOIUrl":"https://doi.org/10.1145/3811390","url":null,"abstract":"Generating high-quality stereo videos requires consistent depth perception and temporal coherence across frames. Despite advances in image and video synthesis using diffusion models, producing high-quality stereo videos remains a challenging task due to the difficulty of maintaining consistent temporal and spatial coherence between left and right views. We introduce DissolveStereo , a novel framework for zero-shot stereo video generation that leverages video diffusion priors without requiring paired training data. Our key innovations include a noisy restart strategy to initialize stereo-aware latent representations and an iterative refinement process that progressively harmonizes the latent space, addressing issues like temporal flickering and view inconsistencies. Importantly, we propose the use of dissolved depth maps to streamline latent space operations by reducing high-frequency depth information. Our comprehensive evaluations, including quantitative metrics and user studies, demonstrate that DissolveStereo produces high-quality stereo videos with enhanced depth consistency and temporal smoothness. In terms of epipolar consistency, our method achieves an 11.7% improvement in MEt3R score over the current state-of-the-art. Furthermore, user studies indicate strong perceptual gains over the previous arts, with an 8.0% higher perceived frame quality and 10.9% higher perceived temporal coherence. Our code is in https://github.com/shijianjian/DissolveStereo.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"1 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148371940","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

Fast and Exact Winding Numbers for Triangle Meshes 快速和准确的缠绕数字三角形网格

IF 6.2 1区计算机科学

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

Peiyuan Xie, Christian Hafner, Chris Wojtan

引用次数: 0

Learned Universal Interoperable Virtual Try-ON 学习了通用互操作虚拟试穿

IF 6.2 1区计算机科学

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

Cong Cao, Xianhang Cheng, Jingyuan Liu, Yujian Zheng, Zhenhui Lin, Ren Li, Meriem Chkir, Hao Li

{"title":"Learned Universal Interoperable Virtual Try-ON","authors":"Cong Cao, Xianhang Cheng, Jingyuan Liu, Yujian Zheng, Zhenhui Lin, Ren Li, Meriem Chkir, Hao Li","doi":"10.1145/3811307","DOIUrl":"https://doi.org/10.1145/3811307","url":null,"abstract":"To enable large-scale reuse of real-world 3D assets-where garments and characters rarely share skeletons, templates, or dense correspondences-we present a fully automated virtual try-on system that dresses complex, multi-layer garments onto diverse, arbitrarily posed humanoids. Our key idea is to use SMPL as an intermediate proxy and decompose clothing-to-body transfer into two correspondence tasks with distinct challenges: (1) clothing-to-SMPL (partial-to-complete alignment) and (2) body-to-SMPL (large pose/shape variation and stylization). We address clothing-to-SMPL using a geometry-driven correspondence model, and introduce a diffusion-based body-to-SMPL correspondence approach that leverages multi-view consistent appearance features together with a pretrained 2D foundation model. Using these correspondences, we register SMPL/SMPL+D (Displacement) to the garment and target body and then perform simulator-driven fitting by transferring the garment along a smooth SMPL→SMPL+D transition, producing physically plausible draping on the target. Our system handles complex garment topology (including non-manifold meshes) and generalizes to a wide range of humanoid characters (e.g., humans, robots, cartoons, and creatures) while remaining computationally practical. Upon draping, our system also supports fast customization of clothing size. We show that our system can produce high-quality 3D clothing fittings without any human labor, even when 2D clothing sewing patterns are not available. Our project page is: https://cao-cong0.github.io/LUIVITON-Learned-Universal-Interoperable-VIrtual-Try-ON/.","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":"148372008","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

Efficient Multiscale Lanczos Eigenpair Extraction 高效多尺度Lanczos特征对提取

IF 6.2 1区计算机科学

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

Theo Braune, Jérémie Dumas, Jean-Marc Thiery

引用次数: 0

CasLayout: Cascaded 3D Layout Diffusion for Indoor Scene Synthesis with Implicit Relation Modeling CasLayout：基于隐式关系建模的室内场景合成级联三维布局扩散

IF 6.2 1区计算机科学

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

Yingrui Wu, You-Kang Kong, Mingyang Zhao, Weize Quan, Dongmin Yan, Yang Liu

{"title":"CasLayout: Cascaded 3D Layout Diffusion for Indoor Scene Synthesis with Implicit Relation Modeling","authors":"Yingrui Wu, You-Kang Kong, Mingyang Zhao, Weize Quan, Dongmin Yan, Yang Liu","doi":"10.1145/3811347","DOIUrl":"https://doi.org/10.1145/3811347","url":null,"abstract":"Synthesizing realistic 3D indoor scenes remains challenging due to data scarcity and the difficulty of simultaneously enforcing global architectural constraints and local semantic consistency. Existing approaches often overlook structural boundaries or rely on fully connected relation graphs that introduce redundant generation errors. Inspired by human design cognition, we present CasLayout, a cascaded diffusion framework that decomposes the joint scene generation task into four conditional sub-stages with explicit physical and semantic roles: (1) predicting furniture quantity and categories, (2) refining object sizes and feature embeddings, (3) modeling spatial relationships in a latent space, and (4) generating Oriented Bounding Boxes (OBBs). This decoupled architecture reduces data requirements and enables flexible integration of Large Language Models (LLMs) and Vision Language Models (VLMs) for zero-shot tasks such as image-to-scene generation. To maintain physical validity within complex floor plans, we explicitly model building elements ( e.g. , walls, doors, and windows) as conditional constraints. Furthermore, to address the high entropy of dense relation graphs, we introduce a sparse relation graph formulation aligned with human spatial descriptions. By encoding these sparse graphs into a compact latent space using a bidirectional Variational Autoencoder (VAE), the proposed framework provides enhanced relational controllability, allowing generated layouts to better respect functional organization. Experiments demonstrate that CasLayout achieves state-of-the-art performance in fidelity and diversity while enabling improved controllability in practical applications.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"31 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372013","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

Kinetic Predicted-Moment Flux Reconstruction for High-Order High-Performance Fluid Simulation 高阶高性能流体模拟的动力学预测矩通量重建

IF 6.2 1区计算机科学

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

Zike Xu, Xuan Zhang, Xiaopei Liu

{"title":"Kinetic Predicted-Moment Flux Reconstruction for High-Order High-Performance Fluid Simulation","authors":"Zike Xu, Xuan Zhang, Xiaopei Liu","doi":"10.1145/3811292","DOIUrl":"https://doi.org/10.1145/3811292","url":null,"abstract":"The simultaneous pursuit of high fidelity, large computational throughput, and a minimal memory footprint has long constituted the central challenge in fluid simulation research. Yet state-of-the-art methods struggle to reconcile all these objectives, and often entail navigating trade-offs among them. We present Kinetic Predicted-Moment Flux Reconstruction (KPM-FR), a high-order kinetic-based scheme for low-Mach-number weakly compressible flows that advances all three fronts within a single framework. KPM-FR is a flux-form fluid flow solver rooted in the principles of the gas-kinetic scheme (GKS), deriving numerical fluxes from the locally evolved Boltzmann-BGK equation to recover Navier-Stokes (NS) solutions. Departing from the GKS and its variants, it carries out kinetic evolution entirely in moment space within the high-order flux reconstruction (FR) framework through a concise predictor-corrector scheme. This translates to two fused GPU kernels per time step, streamlining computation and confining intermediate data to on-chip memory. This design confers several practical advantages. First, compared to conventional high-fidelity lattice Boltzmann methods (LBM), the moment-based formulation reduces the per-point memory footprint by more than fivefold. Second, at matched resolutions, its high-order spatial formulation exhibits markedly lower numerical dissipation, preserving fine-scale vortical structures with greater fidelity. Combining these advantages with a near-saturated throughput exceeding 8 billion solution-point updates per second on a single consumer GPU, KPM-FR delivers large-scale fluid simulation on commodity hardware. Quantitative benchmarks confirm highorder spatial convergence and spectral-like dissipation characteristics, while validation against reference data for flow past solid bodies verifies its practical accuracy. Ultimately, we demonstrate the versatility of KPM-FR across complex geometries and large-scale turbulent flows, capturing multiscale structures with 1.8 billion solution points on a single desktop workstation.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"58 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372026","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

Low-Rank Koopman Deformables with Log-Linear Time Integration 具有对数线性时间积分的低秩Koopman变形量

IF 6.2 1区计算机科学

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

Yue Chang, Peter Yichen Chen, Eitan Grinspun, Maurizio M. Chiaramonte

{"title":"Low-Rank Koopman Deformables with Log-Linear Time Integration","authors":"Yue Chang, Peter Yichen Chen, Eitan Grinspun, Maurizio M. Chiaramonte","doi":"10.1145/3811273","DOIUrl":"https://doi.org/10.1145/3811273","url":null,"abstract":"We present a low-rank Koopman operator formulation for accelerating deformable subspace simulation. Using a Dynamic Mode Decomposition (DMD) parameterization of the Koopman operator, our method learns the temporal evolution of deformable dynamics and predicts future states through efficient matrix evaluations instead of sequential time integration. This yields log-linear scaling in the number of time steps and allows large portions of the trajectory to be skipped while retaining accuracy. The resulting temporal efficiency is especially advantageous for optimization tasks such as control and initial-state estimation, where the objective often depends largely on the final configuration. To broaden the scope of Koopman-based reduced-order models in graphics, we introduce a discretization-agnostic extension that learns shared dynamic behavior across multiple shapes and mesh resolutions. Prior DMD-based approaches have been restricted to a single shape and discretization, which limits their usefulness for tasks involving geometry variation. Our formulation generalizes across both shape and discretization, which enables fast shape optimization that was previously impractical for DMD models. This expanded capability highlights the potential of Koopman operator learning as a practical tool for efficient deformable simulation and design.","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":"148372037","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

PQ-Free HD: Priority-Queue-Free Hausdorff Distance for Triangle Meshes on GPU PQ-Free HD: GPU上三角形网格的优先级-队列- free Hausdorff距离

IF 6.2 1区计算机科学

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

Zhihao Hu, Renjie Chen

{"title":"PQ-Free HD: Priority-Queue-Free Hausdorff Distance for Triangle Meshes on GPU","authors":"Zhihao Hu, Renjie Chen","doi":"10.1145/3811324","DOIUrl":"https://doi.org/10.1145/3811324","url":null,"abstract":"Computing the Hausdorff distance between triangle meshes with guaranteed accuracy is a computationally intensive task. Conventional Branch-and-Bound (B&B) approaches are fundamentally ill-suited for massive parallelism. Their reliance on a global priority queue (PQ) for both best-first scheduling and global termination checks creates a serial bottleneck that prevents scalable performance. We introduce PQ-Free HD , a parallel B&B framework that eliminates this dependency by decoupling the algorithm's termination logic from its scheduling order. This is achieved by relaxing the culling criterion, thereby replacing the priority queue with a contention-free ring buffer, which transforms the execution model from a state-dependent serial search into a high-throughput, asynchronous batch-processing paradigm. The framework consists of four key components: (1) a parallel priority-queue-free B&B paradigm; (2) a hierarchical GPU execution architecture combining batched depth-first scheduling with fused collaborative kernels; (3) a geometrically robust seven-stage culling pipeline featuring novel tests for challenging geometries; and (4) a compact 29-byte procedural task descriptor that achieves an 83.9% memory reduction. Evaluations demonstrate substantial speedups: a median of 71.7× over the state-of-the-art CPU algorithm on general benchmarks, and exceeding 10,000× on challenging CAD models with dense planar structures. The throughput advantage scales super-linearly with problem complexity. We showcase practical value by building a strictly Hausdorff-distance-bounded mesh simplification tool entirely on the GPU. Our work provides a new method for high-throughput, tolerance-controllable B&B-based geometric queries on GPUs. Code and data are available at https://github.com/huzhihao2001/pqfree-hd.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"39 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372137","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

MPM Lite: Linear Kernels and Integration without Particles MPM Lite：线性核和集成没有粒子

IF 6.2 1区计算机科学

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

Xiang Feng, Yunuo Chen, Chang Yu, Hao Su, Demetri Terzopoulos, Yin Yang, Joe Masterjohn, Alejandro Castro, Chenfanfu Jiang

{"title":"MPM Lite: Linear Kernels and Integration without Particles","authors":"Xiang Feng, Yunuo Chen, Chang Yu, Hao Su, Demetri Terzopoulos, Yin Yang, Joe Masterjohn, Alejandro Castro, Chenfanfu Jiang","doi":"10.1145/3811294","DOIUrl":"https://doi.org/10.1145/3811294","url":null,"abstract":"We introduce MPM Lite, a hybrid Lagrangian/Eulerian method that eliminates the need for particle-based quadrature at solve time. Standard Material Point Method (MPM) practices suffer from a performance bottleneck where expensive implicit solves are proportional to particle-per-cell (PPC) counts due to the the choices of particle-based quadrature and wide-stencil kernels. By contrast, MPM Lite treats particles primarily as carriers of kinematic state and material history. Conceptualizing the background Cartesian grid as a voxel hexahedral mesh, we resample particle states onto fixed-location quadrature points using efficient, compact linear kernels. This architectural shift allows force assembly and the entire time-integration process to proceed without accessing particles, thus making the solver's complexity independent of the particle count. At the core of our method is a novel stress transfer and stretch reconstruction strategy. To avoid non-physical averaging of deformation gradients, we resample the extensive Kirchhoff stress and derive a rotation-free deformation reference solution, which naturally supports an optimization-based incremental potential formulation. Consequently, MPM Lite can be implemented as modular resampling units coupled with an FEM-style integration module, enabling the direct use of off-the-shelf nonlinear solvers, preconditioners, and unambiguous boundary conditions. We demonstrate through extensive experiments that MPM Lite preserves the robustness and versatility of traditional MPM across diverse materials while delivering significant speedups in implicit settings while simultaneously improving explicit ones. Project page: https://mpmlite.github.io.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"1 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372138","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

Implicit Minimal Surfaces for Bijective Correspondences 双射对应的隐极小曲面

IF 6.2 1区计算机科学

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

Etienne Corman, Yousuf Soliman, Robin Magnet, Mark Gillespie

{"title":"Implicit Minimal Surfaces for Bijective Correspondences","authors":"Etienne Corman, Yousuf Soliman, Robin Magnet, Mark Gillespie","doi":"10.1145/3811368","DOIUrl":"https://doi.org/10.1145/3811368","url":null,"abstract":"We introduce an implicit representation of continuous, bijective, orientation-preserving maps between genus zero surfaces with or without boundary. The distortion of these maps can easily be minimized by optimizing the Ginzburg-Landau functional—a ubiquitous model in physics and differential geometry—leading to a simple algorithm for computing bijective correspondences using only standard tools of the tangent vector field toolbox. The method avoids combinatorial mesh modifications and does not require barrier functions to enforce bijectivity making it more robust to noise and simpler to implement. Moreover, the algorithm does not assume a bijective initialization and can untangle non-bijective correspondences generated by computationally cheaper methods such as functional maps. It supports the use of both landmark points and landmark curves to guide the correspondence. The key idea is that a bijection between surfaces defines a two-dimensional mapping surface sitting inside the four-dimensional product space of the two inputs, and this mapping surface can be stored implicitly as the zero set of a complex section —essentially a complex function defined on the product space. Now the distortion of the map can be optimized by minimizing the area of this mapping surface, which amounts to minimizing the Ginzburg-Landau functional of the complex section. We demonstrate the practical benefits of our method by comparing to state-of-the-art correspondence algorithms and show that our implicit representation offers improved stability and naturally supports constraints that are difficult to enforce with explicit map representations.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"32 1","pages":""},"PeriodicalIF":6.2,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148372140","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