Generating high-quality meshes for arbitrary geometries remains a fundamental bottleneck in computational engineering, often demanding heuristic tuning and semi-manual workflows. In this paper, we introduce Dmsh, a first fully automated reinforcement learning pipeline that unifies geometric decomposition and quadrilateral mesh generation within a single learning-based framework.
arXiv:2606. 10601v1 Announce Type: cross Abstract: Generating high-quality meshes for arbitrary geometries remains a fundamental bottleneck in computational engineering, often demanding heuristic tuning and semi-manual workflows.
arXiv:2606. 26333v1 Announce Type: new Abstract: Reinforcement learning in large or sparse-reward environments suffers from slow temporal-difference reward propagation, as value information spreads only locally across the state space.
arXiv:2606. 31252v1 Announce Type: new Abstract: Large language models can write plausible CAD scripts, but reliable industrial CAD modeling requires more than syntactically valid code: every feature, placement, and assembly relation must be accepted by an exact geometric kernel while remaining editable as parametric boundary representation geometry.
arXiv:2609.07137v1 Announce Type: cross Abstract: Recent image-to-3D generation models built on flow-matching diffusion Transformers (DiT) can produce high-fidelity meshes, yet their post-training st...
arXiv:2606. 10611v1 Announce Type: new Abstract: Traditional heuristic solvers for the 2D irregular nesting problem share a fundamental limitation: they are blind to polygon geometry, relying on guided brute-force to navigate the continuous placement space with minimal geometrical guidance.
Traditional heuristic solvers for the 2D irregular nesting problem share a fundamental limitation: they are blind to polygon geometry, relying on guided brute-force to navigate the continuous placement space with minimal geometrical guidance. In this paper, we argue that Reinforcement Learning is uniquely positioned to overcome this bottleneck.
The paper presents HSAC, a reinforcement learning method that builds covering structures without predefined plans, using graph-structured states and a mixed action space of discrete block selection and continuous placement. It extends soft actor-critic with unilateral edges in graph neural networks to efficiently explore while simulating stability. Experiments show HSAC outperforms hybrid-PPO, remains robust to hyperparameters, and successfully transfers to a real two-robot 3D‑printed arch construction.
The paper presents a reinforcement learning method, HSAC, that builds covering structures without relying on rigid, pre‑planned sequences. It uses graph‑structured state representations and a mixed action space to select blocks and adjust their placement continuously, while an efficient exploration strategy incorporates unilateral edges into graph neural networks. HSAC outperforms the prior hybrid‑PPO approach, shows strong sample efficiency, robustness to hyperparameters, and successfully transfers policies from simulation to a real two‑robot 3D‑printed block construction task.
arXiv:2605. 19748v2 Announce Type: replace Abstract: Automatic generation of computer-aided design (CAD) models is a core technology for enabling intelligence in advanced manufacturing.
arXiv:2610.02507v1 Announce Type: new Abstract: We present MeshQuery, a training-free agentic approach to automatic UV unwrapping of production-grade quad meshes. A Vision-Language Model (VLM) plans...
arXiv:2606. 07602v1 Announce Type: cross Abstract: LLM-based LEGO assembly generation requires both semantic grounding and physical feasibility.
arXiv:2609.23386v1 Announce Type: new Abstract: Text-guided 3D building generation holds tremendous application potential, yet existing generative models typically output inseparable single meshes or...