arXiv:2606. 16333v1 Announce Type: cross Abstract: Most existing approaches either fix the container in advance or optimize only a single container dimension through an outer search loop, leaving the remaining dimensions as a manual tuning problem.
arXiv:2607. 08025v1 Announce Type: new Abstract: While neural PDE solvers have demonstrated significant potential for accelerating engineering simulations, existing architectures remain constrained by high memory consumption and the single node bottleneck, where the maximum processable mesh resolution is strictly limited by the VRAM of a single compute unit.
arXiv:2608.24738v1 Announce Type: new Abstract: Morphological transforms are long-standing tools for shape and mask processing, but the de facto reference implementation in the Python ecosystem, i.e....
The paper introduces a differentiable voxelization technique that computes gradients of volumetric properties, such as winding numbers, with respect to surface mesh parameters. This method allows efficient optimization of triangle meshes using voxel-based volume samples on a regular grid. The authors demonstrate its utility in applications like resolving mesh intersections, designing manufacturable shapes for bandsaw cutting, and creating near-tiling 3D structures.
arXiv:2608.23869v1 Announce Type: new Abstract: While state-of-the-art generative models produce high-fidelity 3D meshes, these outputs lack the physical properties required for interactive simulatio...
While neural PDE solvers have demonstrated significant potential for accelerating engineering simulations, existing architectures remain constrained by high memory consumption and the single node bottleneck, where the maximum processable mesh resolution is strictly limited by the VRAM of a single compute unit. To address these challenges, we propose PGD-NO, a neural operator with Precomputed Geometry Decomposition, that relocates the computational overhead of geometric encoding to a deterministic pre-computation phase.
Morphological transforms are long-standing tools for shape and mask processing, but the de facto reference implementation in the Python ecosystem, i.e. scipy.ndimage, is CPU-only, single-array, and th...
arXiv:2603. 11021v2 Announce Type: replace Abstract: Scalar quantization of large language models (LLMs) is fundamentally limited by information-theoretic bounds.
arXiv:2602. 04940v2 Announce Type: replace Abstract: Deep learning has emerged as a transformative tool for the neural surrogate modeling of partial differential equations (PDEs), known as neural PDE solvers.
AnyBox is a zero‑shot framework that estimates the full 9DoF pose (6D pose plus 3D dimensions) of boxes from a single RGB‑D image, leveraging the geometric regularity of boxes. It alternates between pose and scale estimation, using a binary search guided by the discrepancy between a reprojected template and the observed mask, and employs a depth‑consistency filter and an early‑stopping rule to prune implausible hypotheses. On public benchmarks and a warehouse dataset, AnyBox improves detection AP by up to 36 points and boosts robotic box‑shelving success by 28%.
KaiNinja extends the native 3D generator TRELLIS.2 to produce part-level meshes by introducing a dual‑volume representation that overcomes the single‑sheet limitation of the O‑Voxel grid. It maintains TRELLIS.2’s speed and quality while eliminating the need for external segmentation, and is trained on diverse data including CAD models and assets created by an LLM‑driven agent. The method improves whole‑object fidelity and outperforms other part‑generation pipelines, reducing Chamfer distance by 40% and increasing strict part F‑score by 16%.
arXiv:2609.15659v1 Announce Type: cross Abstract: Native 3D generators turn one image into a single mesh. TRELLIS.2 and its peers deliver high-fidelity non-watertight geometry with materials, but the...
arXiv:2606. 00844v1 Announce Type: cross Abstract: Bounding-box regression is a fundamental component of object detection, playing a critical role in precise object localization.