Searcharxiv⌕ Search

arXiv · 2610.24210

Colour-Field Based Particle Categorization for Residual Stress Detection and Reduction in Solid SPH Simulations

Abstract

Residual stress remains in an object even in the absence of external forces or thermal pressure, which, in turn, may cause significant plastic deformations. In case the residual stress creates unwanted effects on the material and so is undesirable, an efficient solution is necessary to track and eliminate this stress. Smoothed Particle Hydrodynamics has been extensively used in solid mechanics simulations and the inherent colour-field generation approach is a promising tracker for the residual stress. In this paper, we propose a way to use the colour-field approach for eliminating the residual stress and prevent the undesirable premature failure of solid objects.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gizem Kayar. 2026-10-16. Colour-Field Based Particle Categorization for Residual Stress Detection and Reduction in Solid SPH Simulations. https://doi.org/10.5220/0011716100003417

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

KEEP EXPLORING

Related papers

Assessing the CAD Capabilities of General-Purpose AI Models: A Case Study of GPT-6 Astra

Recent advances in general-purpose AI models and agentic systems have enabled them to perform some CAD tasks. A systematic assessment is now needed to establish what these systems can accomplish and how well their outputs meet engineering requirements. This paper presents an empirical study of GPT-6 Astra, a SOTA general-purpose AI model, across four basic CAD tasks: model understanding, generation, editing, and evaluation. We design test cases spanning different levels of complexity and engineering requirements. The results show that GPT-6 Astra can support multiple stages of CAD workflows, with successful outcomes in cases involving nontrivial geometric complexity. This suggests that general-purpose AI is beginning to offer practical value in almost all steps in CAD workflow. However, gaps remain between generating visually plausible geometry and producing valid, functional, and editable CAD models. Recurring errors in freeform geometry, parameter dependencies, and mating relationships between parts limit engineering usefulness. Agentic iterative refinement can improve results but does not consistently resolve critical errors; long completion times further constrain practical use.

cs.GR↗

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

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.

cs.GR↗

Energy-minimized interpolatory B-spline lofting for sequences of closed contours

B-spline lofting through closed cross-sections is common in reverse engineering, but interpolating each section on its own knot vector can produce an unnecessarily large control net. We construct a common-knot method for closed section curves of odd and even degree by minimizing the strain energy of each section subject to its interpolation constraints. Feasibility for closed section data and uniqueness of the resulting saddle-point solution require full row rank of the periodic collocation matrices, a property that a previously proposed periodic Schoenberg-Whitney window condition does not always guarantee. We establish the exact parity distinction: the condition is sufficient at odd point counts but admits singular configurations at every admissible even point count. For the odd and even degrees used here, the natural and shifting anchor knots are nonsingular; at odd point counts the window condition certifies the selected candidate, whereas at even point counts a rank test with an anchor fallback is applied. The lofting method therefore retains a nonsingular square subsystem for each section and uses nestedness to transfer full row rank to the rectangular common-knot system. Across six closed-contour models the common-knot method uses 83-98% fewer control points than traditional interpolating lofting, with section energies no larger than those of a previous knot-selection method within numerical precision.

cs.GR↗