Scaling Mesh Generation via Compressive Tokenization

Haohan Weng, Zibo Zhao, Biwen Lei, Xianghui Yang, Jian Liu +8 more
2/9/2026

No official code found. Best implementation: Tencent-Hunyuan/bpt (308 stars, last commit 2025-07-30).

Abstract

We propose a compressive yet effective mesh tokenization, Blocked and Patchified Tokenization (BPT), facilitating the generation of meshes exceeding 8k faces. BPT compresses mesh sequences by employing block-wise indexing and patch aggregation, reducing their length by approximately 75% compared to the vanilla coordinate sequences. This compression milestone unlocks the potential to utilize mesh data with significantly more faces, thereby enhancing detail richness and improving generation robustness. Empowered with the BPT, we have built a foundation mesh generative model training on scaled mesh data to support flexible control for point clouds and images. Our model demonstrates the capability to generate meshes with intricate details and accurate topology, achieving SoTA performance on mesh generation and reaching the level for direct product usage.

View on arXivView PDF

Code Implementations(1)

Official code for paper: Scaling Mesh Generation via Compressive Tokenization [CVPR'25]

30815PythonNov 11, 20241 years agoNOASSERTION

Similar Papers

Cite this paper

@article{weng2026scaling,
  title  = {Scaling Mesh Generation via Compressive Tokenization},
  author = {Haohan Weng and Zibo Zhao and Biwen Lei and Xianghui Yang and Jian Liu and Zeqiang Lai and Zhuo Chen and Yuhong Liu and Jie Jiang and Chunchao Guo and Tong Zhang and Shenghua Gao and C. L. P. Chen},
  year   = {2026},
  eprint = {2411.07025},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2411.07025},
  journal = {CVPR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.07025.svg)](https://codeofpaper.com/paper/2411.07025)

Discussion