MeshWeaver: Sparse-Voxel-Guided Surface Weaving for Autoregressive Mesh Generation
- URL: http://arxiv.org/abs/2606.04688v1
- Date: Wed, 03 Jun 2026 10:15:43 GMT
- Title: MeshWeaver: Sparse-Voxel-Guided Surface Weaving for Autoregressive Mesh Generation
- Abstract summary: MeshWeaver is an autoregressive framework that treats mesh generation as a surface weaving process.<n>MeshWeaver achieves a state-of-the-art compression ratio of 18%, can generate meshes with up to 16K faces, and significantly improves geometric fidelity over prior approaches.
- Score: 53.06620176910962
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Autoregressive mesh generation has gained attention by tokenizing meshes into sequences and training models in a language-modeling fashion. However, existing approaches suffer from two fundamental limitations: (i) low tokenization efficiency, which yields long token sequences and prevents scaling to high-poly meshes, and (ii) absence of geometry-aware guidance, as generation is conditioned only on global shape embeddings rather than local surface cues. We introduce MeshWeaver, an autoregressive framework that treats mesh generation as a surface weaving process by directly predicting the next vertex instead of independent coordinates. At its core is a multi-level sparse-voxel encoder that injects geometric context into the generative process in three complementary ways: providing voxel features as vertex representations, guiding token prediction via cross-attention to voxel features, and serving as a structural scaffold that constrains generation around the input surface. Our hierarchical design enables coarse-to-fine vertex prediction in a single decoding step, while tightly coupling the generative model with 3D geometry. Extensive experiments demonstrate that MeshWeaver achieves a state-of-the-art compression ratio of 18%, can generate meshes with up to 16K faces, and significantly improves geometric fidelity over prior approaches.
Related papers
- Meshy T2: Fast Native Mesh Generation with Flow Matching [8.108033268825832]
We present Meshy T2, a fast native mesh generation framework built on flow matching.<n>In experiments, Meshy T2 achieves state-of-the-art geometric fidelity and completes end-to-end image-to-mesh generation within a median of 6 seconds.
arXiv Detail & Related papers (2026-07-28T16:33:54Z) - FACE: A Face-based Autoregressive Representation for High-Fidelity and Efficient Mesh Generation [50.71369329585773]
We introduce FACE, a novel Autoregressive Autoencoder framework that generates meshes at the face level.<n>Our one-face-one-token strategy treats each triangle face, the fundamental building block of a mesh, as a single, unified token.<n> FACE achieves state-of-the-art reconstruction quality on standard benchmarks.
arXiv Detail & Related papers (2026-03-02T06:47:15Z) - MeshRipple: Structured Autoregressive Generation of Artist-Meshes [43.29985039393799]
Meshes serve as a primary representation for 3D assets.<n>We introduce MeshRipple, which expands a mesh outward from an active generation frontier, akin to a ripple on a surface.<n>This integrated design enables MeshRipple to generate meshes with high surface fidelity and topological completeness, outperforming strong recent baselines.
arXiv Detail & Related papers (2025-12-08T12:50:23Z) - ARMesh: Autoregressive Mesh Generation via Next-Level-of-Detail Prediction [45.699110709239996]
We propose generating 3D meshes auto-regressively in a progressive coarse-to-fine manner.<n>Specifically, we view mesh simplification algorithms, which gradually merge mesh faces to build simpler meshes.<n>Our experiments show that this novel progressive mesh generation approach provides intuitive control over generation quality and time consumption.
arXiv Detail & Related papers (2025-09-25T07:12:02Z) - MeshMosaic: Scaling Artist Mesh Generation via Local-to-Global Assembly [62.48017648785026]
We introduce MeshMosaic, a novel local-to-global framework for artist mesh generation that scales to over 100K triangles.<n>We show that MeshMosaic significantly outperforms state-of-the-art methods in both geometric fidelity and user preference.
arXiv Detail & Related papers (2025-09-24T11:02:03Z) - Nautilus: Locality-aware Autoencoder for Scalable Mesh Generation [46.08876528701562]
We propose Nautilus, a locality-aware autoencoder for artist-like mesh generation.<n>Our approach introduces a novel tokenization algorithm that preserves face proximity relationships.<n>We also develop a Dual-stream Point Conditioner that provides multi-scale guidance.
arXiv Detail & Related papers (2025-01-24T08:22:02Z) - SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes [61.110517195874074]
We present a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network.<n>Our key innovation is to define a continuous latent connectivity space at each mesh, which implies the discrete mesh.<n>In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.
arXiv Detail & Related papers (2024-09-30T17:59:03Z) - MeshXL: Neural Coordinate Field for Generative 3D Foundation Models [51.1972329762843]
We present a family of generative pre-trained auto-regressive models, which addresses the process of 3D mesh generation with modern large language model approaches.
MeshXL is able to generate high-quality 3D meshes, and can also serve as foundation models for various down-stream applications.
arXiv Detail & Related papers (2024-05-31T14:35:35Z) - Primal-Dual Mesh Convolutional Neural Networks [62.165239866312334]
We propose a primal-dual framework drawn from the graph-neural-network literature to triangle meshes.
Our method takes features for both edges and faces of a 3D mesh as input and dynamically aggregates them.
We provide theoretical insights of our approach using tools from the mesh-simplification literature.
arXiv Detail & Related papers (2020-10-23T14:49:02Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.