Search arXiv⌕ Search

arXiv · 2610.24459

SLIM: Learning an Operator for Material-Efficient 3D Lattice Refinement

Abstract

Lattice inverse-design methods can generate cells that match prescribed effective properties, but property feasibility does not imply material efficiency. Removing redundant material from an existing lattice while preserving its homogenized elasticity ordinarily requires solving a separate constrained topology optimization problem for each cell, making large-scale refinement computationally expensive. We introduce SLIM (Structural Lightweighting via Implicit Mapping), a neural lattice-refinement model that replaces this per-instance iterative optimization with a single forward prediction. SLIM uses a dual-octree implicit network to predict the signed-distance field of a lightweight lattice and is trained on input--output pairs generated by property-constrained topology optimization. To improve stiffness preservation, we use homogenization sensitivities computed on the optimized target to estimate how residual voxel errors in a prediction affect its homogenized stiffness, and penalize this estimated change during training. Once trained, SLIM requires no topology optimization, homogenization analysis, or sensitivity evaluation during prediction. On the held-out test set of 906 lattices, SLIM achieves a mean relative volume-fraction reduction of 15.90%, a lightweighting success rate of 90.51%, and a mean normalized aggregate TO-target error of 0.636%, while reducing the average per-lattice generation time from 2516.0 s with direct TO to approximately 0.5 s. These results show that SLIM provides a fast neural surrogate for repeated topology-optimization-based refinement of 3D lattices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yueze Zhu, Yu Xing, Tianyang Xue, Peng-Shuai Wang, Jikai Liu, Haisen Zhao, Lin Lu. 2026-10-17. SLIM: Learning an Operator for Material-Efficient 3D Lattice Refinement. https://arxiv.org/abs/2610.24459

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quantized High-Performance High-Order Moment-Encoded LBM

Lattice Boltzmann methods (LBM) are widely used for visually rich fluid simulation, but their high memory bandwidth and storage requirements limit GPU performance and scalability, especially when coupled with complex geometry. Recent high-order moment-encoded LBM (HOME-LBM) reduces memory cost by storing compact velocity moments and performing collision directly in moment space, but its tightly coupled boundary treatment introduces divergent control flow. We present a high-performance, quantized HOME-LBM framework for large-scale turbulent fluid-solid simulations on a single GPU. Our geometry-decoupled computation scheme separates the regular fluid update from a sparse solid-correction stage, isolating geometry-dependent computations to improve GPU efficiency. To further reduce storage and memory traffic, we develop a reduced-precision representation for HOME-LBM by combining von Neumann stability analysis, empirical moment-range estimation, and runtime decomposition of second-order moments to control quantization error. We evaluate our approach on real-time demonstrations and large-scale examples using both D3Q19 and D3Q27 lattices, with additional 2D and 3D numerical experiments assessing accuracy and stability. Across the tested benchmarks, our framework substantially accelerates the original FP32 HOME-LBM implementation, with a maximum speedup of 32.5x on the Hilbert-curve geometry. Moment storage is reduced by 50% in fluid-only simulations and 25% in fluid-solid coupling examples, while maintaining numerical stability, fidelity, and high visual quality. In the static delta-wing benchmark, our solver achieves a 5.2x speedup over Leapfrog Flow Maps (LFM) under the tested configuration.

cs.GR↗

Skin Tokens: A Learned Compact Representation for Unified Autoregressive Rigging

The rapid proliferation of generative 3D models has created a critical bottleneck in animation pipelines: rigging. Existing automated methods are fundamentally limited by their approach to skinning, treating it as an ill-posed, high-dimensional regression task that is inefficient to optimize and is typically decoupled from skeleton generation. We posit this is a representation problem and introduce SkinTokens: a learned, compact, and discrete representation for skinning weights. By leveraging an FSQ-CVAE to capture the intrinsic sparsity of skinning, we reframe the task from continuous regression to a more tractable token sequence prediction problem. This representation enables TokenRig, a unified autoregressive framework that models the entire rig as a single sequence of skeletal parameters and SkinTokens, learning the complicated dependencies between skeletons and skin deformations. The unified model is then amenable to a reinforcement learning stage, where tailored geometric and semantic rewards improve generalization to complex, out-of-distribution assets. Quantitatively, the SkinTokens representation leads to a 98%-133% percents improvement in skinning accuracy over state-of-the-art methods, while the full TokenRig framework, refined with RL, enhances bone prediction by 17%-22%. Our work presents a unified, generative approach to rigging that yields higher fidelity and robustness, offering a scalable solution to a long-standing challenge in 3D content creation.

cs.GR↗

Walk in Envelopes: Efficient Branching Walk-on-Spheres via Certified Solution Bounds

Branching Walk-on-Spheres (WoS) solves semilinear PDEs without meshes, but its computational cost grows sharply near critical branching rates. We introduce Walk in Envelopes (WiE), which uses certified solution bounds to transform branching diffusion rather than prune existing trees. The transformation suppresses reproduction, introduces controlled termination, and preserves unbiasedness with an envelope-dependent variance bound. We realize the transformed process through exact rejection sampling using standard screened WoS kernels, supported by certified spline envelopes and adaptive sampling, and further prove that suitable harmonic envelopes yield bounded expected reproduction counts even as conventional BBM diverges.

cs.GR↗