Pith. sign in

REVIEW 4 major objections 6 minor 1 cited by

FreeMesh: Boosting Mesh Generation with Coordinates Merging

T0 review · 4 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proposes Per-Token-Mesh-Entropy as a training-free measure of mesh-tokenizer quality, then uses it to justify a rearrange-and-merge coordinate compression that cuts sequence length by 58% and lowers Chamfer distance from 0.198…

desk verdict The coordinate-merging trick is a genuinely useful plug-in for mesh tokenizers, but the PTME metric is oversold and its validation in Appendix D is currently broken. read the letter →

arxiv 2505.13573 v1 pith:UXNGYAMW submitted 2025-05-19 cs.GR cs.AI

Jian Liu , Haohan Weng , Biwen Lei , Xianghui Yang , Zibo Zhao , Zhuo Chen , Song Guo , Tao Han
show 1 more author
Chunchao Guo
This is my paper · ORCID
classification cs.GRcs.AI
keywords meshgenerationautoregressivetransformertokenizationentropymetricbyte-pairencodingcoordinatecompressionpointcloudconditioning3Dshape
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that mesh tokenizers—the front ends that turn a 3D mesh into a sequence of coordinate tokens for autoregressive generation—can be scored without training, and that this score can be lowered on purpose. It proposes Per-Token-Mesh-Entropy (PTME), which multiplies the entropy per merged coordinate substring by the tokenizer's compression ratio; lower PTME is claimed to mean an easier-to-learn sequence. Building on PTME, it introduces Rearrange & Merge Coordinates (RMC): group each face's coordinates axis by axis (all x's, then all y's, then all z's) before byte-pair merging, so the repeated patterns the merge finds actually co-occur. Applied to the best-performing baseline tokenizer, RMC cuts the compression ratio from 0.505 to 0.212 and improves point-cloud conditioned generation, with Chamfer distance falling from 0.198 to 0.123. The payoff would be that any autoregressive mesh pipeline can be strengthened by a tokenizer-agnostic post-processing step rather than a new architecture or retraining from scratch.

What carries the argument

The central object is Per-Token-Mesh-Entropy, $PTME = (H_s / l) \cdot CR$, with $H_s$ the Shannon entropy of the merged coordinate substrings, $l$ their average length measured in coordinates, and $CR$ the compression ratio relative to the raw coordinate stream. It converts "how learnable is this sequence" into one number computable from token frequencies alone. The companion mechanism is RMC (Rearrange & Merge Coordinates), a rule that reserializes every face's coordinates from the interleaved order $x_1,y_1,z_1,x_2,y_2,z_2,x_3,y_3,z_3$ into $x_1,x_2,x_3,y_1,y_2,y_3,z_1,z_2,z_3$, with special handling for subsequences shorter than nine tokens and for direction words, and only then applies byte-pair merging. The rearrangement does not change the information content of the sequence—the paper shows PTME is essentially unchanged after rearrangement alone—but it makes frequent multi-coordinate substrings discoverable, which is what allows merging to reduce PTME.

What would settle it

Hold the model, data, and context window fixed while comparing two tokenizations with equal compression ratio but different PTME; if the lower-PTME tokenization does not produce lower Chamfer distance in a controlled run, the PTME-learnability claim is false.

Watch

Extended reading notes

Core claim

On the paper's terms, the discovery is that the quality of a mesh tokenizer is measurable, before training, by $PTME = (H_s / l) \times CR$, and that this quantity can be minimized by matching the merge operation to the geometry. A naive merge of adjacent coordinates increases PTME because byte-pair merging pairs up numbers that do not repeat when read in the interleaved x-y-z order of the raw serialization. RMC rearranges each group of nine coordinates into contiguous x-runs, y-runs, and z-runs (and shifts direction tokens ahead of coordinates) before merging, so the most frequent substrings are genuinely repeated. The paper reports that with vocabulary size 8192, the rearrangement plus merge lowers PTME from 3.139 to 2.231, lowers the compression ratio from 0.505 to 0.212, and improves Chamfer distance from 0.198 to 0.123 in a point-cloud conditioned mesh generation pipeline, while also admitting more training meshes into the same 9,000-token context window.

Load-bearing premise

The load-bearing premise is that a lower Per-Token-Mesh-Entropy means the sequence is easier to learn and thus generates better meshes; the paper validates that link only with one correlation measured across vocabulary sizes in a single pipeline.

Editorial extensions

If this is right

  • Any existing coordinate-level mesh tokenizer can be compressed further by the same plug-in step, because RMC is applied after serialization and does not require retraining the original tokenizer.
  • Within a fixed context window, a lower compression ratio translates directly to more faces per generated mesh, and the paper shows the RMC variants admit tens of thousands more training meshes under a 9,000-token limit.
  • Compression ratio alone is not a reliable proxy for tokenizer quality; PTME orders two comparable baselines differently from their compression ratios, and that ordering matches the measured generation quality.
  • Sequence order is not sacred: pure coordinate rearrangement leaves generation nearly unchanged, so future work can optimize serialization order without paying a training penalty.
  • PTME can be used to choose vocabulary size without training, because the reported gains from merging plateau once the vocabulary reaches roughly 8,192 entries.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension is to compute PTME for other autoregressive 3D representations, such as point clouds or surface patches, by defining the coordinate unit and substring scheme; the paper's derivation does not depend on triangles specifically.
  • Appendix C's proof implies a prospective rule stronger than frequency-only merging: a merge is entropy-reducing mainly when the pair's co-occurrence probability and pointwise mutual information are both high, which could be used to choose merges rather than diagnosing failures after the fact.
  • The PTME-to-generation link currently rests on one pipeline, so a cheap test is to apply RMC under a different context length, model capacity, or dataset and check whether Chamfer distance still tracks PTME.
  • At higher coordinate quantization, repeated coordinate patterns become rarer, so pattern-based merging may need to become adaptive or byte-level; the paper names this as its main limitation, suggesting a concrete next experiment at 1024-level quantization.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes two contributions for autoregressive mesh generation: a training-free metric, Per-Token-Mesh-Entropy (PTME), intended to measure tokenizer quality, and a plug-and-play coordinate merging technique, called Rearrange & Merge Coordinates (RMC), that rearranges serialized coordinate sequences and then applies BPE-style merging to compress them. The method is evaluated by plugging RAW, AMT, and EDR tokenizers into a unified point-cloud-conditioned autoregressive pipeline at 7-bit quantization. The main empirical result is that EDR+RMC achieves a compression ratio of 0.212 and improves Chamfer distance from 0.198 to 0.123 and Hausdorff distance from 0.408 to 0.280 compared to EDR alone (Table 1). The authors also report that RMC increases the number of meshes fitting within a fixed 9,000-token context window (Figure 6). The paper claims PTME is validated by a strong correlation with downstream Chamfer distance, but that validation is internally contradictory and appears to reuse text from a different domain.

Significance. If the empirical gains are reproducible, RMC is a simple, effective, and practical compression technique for coordinate-level mesh tokenizers: it is training-free on the target model, integrates into existing tokenizers, and consistently improves generation quality across three tokenization schemes in a unified pipeline. The paper also introduces the reasonable idea of using information-theoretic quantities to compare mesh serializations without training. However, the central scientific claim that PTME is a valid predictor of learnability is not established: the only direct validation (Appendix D) contains a sign error, appears to be copied from a molecular-generation context, and is confounded by simultaneous changes in compression ratio and model capacity. The theoretical derivation in Section 3.2 and Appendix C also conflates PCME and PTME. As a result, the motivation for RMC rests on an unvalidated premise, even though the compression and generation results stand as direct empirical observations. The paper would be considerably stronger with corrected validation or a reframed contribution that explicitly treats RMC as an empirically motivated heuristic.

major comments (4)
  1. [Appendix D] The correlation analysis in Appendix D is internally contradictory and cannot serve as evidence for PTME. The text reports 'a strong positive linear correlation: r=0.965' between PTME and CD, then concludes that 'a higher PTME score strongly indicates better downstream generation performance measured by lower Chamfer Distance.' A positive correlation means higher PTME is associated with higher (worse) CD, not lower; the stated conclusion is the opposite of what r=0.965 implies. In addition, the paragraph and Table 2 repeatedly refer to 'molecular generation' and 'generated molecules,' indicating that the analysis as printed was not performed on the mesh-generation experiments in this paper. As the only direct empirical validation of the learnability assumption in Section 3.2, this analysis must be corrected and re-run on mesh data before the PTME claim can be evaluated.
  2. [Section 4.3 and Appendix D] The reported PTME-CD correlation is confounded. The vocabulary-size sweep (256 to 8192) simultaneously changes the compression ratio, the sequence length, the number of tokens consumed per mesh, and the embedding capacity of the model. Therefore, r=0.965 does not identify PTME as the causal predictor of generation quality; the same correlation could be driven by CR or by model capacity alone. The paper claims in Section 4.3 that 'PTME shows a stronger correlation with generation quality than the compression ratio,' but no controlled comparison is provided. A proper test would hold vocabulary size fixed and vary only the rearrangement or merging scheme, or compute partial correlations controlling for CR. Without such a test, the metric's predictive validity is unsupported.
  3. [Sections 3.2 and Appendix C] There is a mismatch between the metric used in the experiments and the quantity analyzed in the proof. The main text defines PTME in Eq. (8) as PTME = (Hs/l) * CR, but Appendix C derives a condition for PCME (Eq. 10) to decrease after merging, assuming CR is constant. Table 1 shows that the baseline MC reduces CR yet increases PTME (e.g., RAW PTME goes from 6.742 to 6.943), which directly contradicts the intuition expressed in Eq. (5) that 'Imerged < Itotal.' The proof in Appendix C only shows a condition for PCME reduction under a simplified probability model, and it does not establish the corresponding statement for PTME. The paper should either provide a direct theoretical guarantee for PTME under RMC or explicitly state that PTME reduction is an empirical property of the proposed rearrangement, not a proven consequence.
  4. [Table 1] Table 1 reports single values with no error bars, standard deviations, or significance tests for any of the generation metrics. Several comparisons are visually small (e.g., EDR+MC CD 0.204 vs. EDR CD 0.198; AMT+RAC CD 0.226 vs. AMT CD 0.219), so without measures of variance it is not possible to assess whether the observed improvements are meaningful. The paper's central empirical claim that RMC improves generation quality would be substantially strengthened by reporting means and standard deviations over multiple training runs or at least over multiple evaluation samples.
minor comments (6)
  1. [Section 3.1] There is a typo in the first sentence of the RAW representation paragraph: 'In theRA Wrepresentation' should be 'In the RAW representation.'
  2. [Figure 2 caption] The caption begins with a lower-case 'w' after a period: 'while the baseline Merge Coordinates (MC) method...' should be 'While the baseline Merge Coordinates (MC) method...'.
  3. [Equation (2)] In Eq. (2), the symbol c is used both for the coordinate sequence (in p(ci | c1:i−1, c; θ)) and for the point-cloud condition c. This overloading is confusing and should be resolved by using a different symbol for one of the two quantities.
  4. [Table 1 caption vs. Section 4.1] The caption of Table 1 states that metrics are computed using '10K sampled points per mesh,' while Section 4.1 says the point cloud encoder processes 8,192 sampled points. These numbers are inconsistent and should be reconciled.
  5. [Appendix D] Appendix D's PTME vs PPL discussion refers to 'molecular generation' and 'generated molecules' rather than meshes. This appears to be a copy-paste error from a different project and should be rewritten for the mesh-generation context, along with the corresponding tables.
  6. [Section 4.1] The point cloud encoder is attributed to 'Michelangeo' (typo for 'Michelangelo') and the reference is listed as Zhao et al., 2024b. Please correct the spelling.

Circularity Check

0 steps flagged · score 0.0 of 10

No material circularity: PTME is a computed tokenizer statistic and the RMC gains in Table 1 are direct empirical measurements, not consequences of the metric by construction.

full rationale

The derivation chain is self-contained. PTME (Eq. 8-9) is defined from empirical substring probabilities and the compression ratio of the serialized mesh; it never includes downstream Chamfer or Hausdorff distance, so the generation improvements in Table 1 are external validation rather than a tautology. Coordinate merging is implemented with standard SentencePiece/BPE, the RMC rearrangement is a deterministic reordering, and the final comparisons are measured against RAW/AMT/EDR baselines. The paper's premise that lower PTME implies easier learning is an assumption tested post hoc in Appendix D; even though that appendix is problematic (it reports r=0.965 positive yet concludes higher PTME predicts lower CD, and it refers to 'molecular generation'), this is a correctness and interpretation issue, not a circular reduction. The only self-citation, BPT (Weng et al. 2024b), is used to justify the transformer architecture and vocabulary-size choice; it does not define PTME or force the coordinate-merging result. No equation in the paper reduces to its own input by construction, and no fitted parameter is renamed as a prediction.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

The paper's contribution rests on the assumption that entropy correlates with learnability, on empirical frequency estimates, and on hand-chosen vocabulary and grouping sizes. No new physical or mathematical entities are introduced.

free parameters (3)
  • target vocabulary size = 8192
    Chosen by hand in Section 3.3 following BPT principles; authors say PTME reduction plateaus beyond this size.
  • BPE training corpus size = 10,000 meshes
    Section 4.1: SentencePiece trained on 10k serialized meshes; no sensitivity analysis provided.
  • coordinate group size for rearrangement = 9 (one face)
    Algorithm 1 groups coordinates in units of 9; needed for AMT/EDR variable-length subsequences but not otherwise justified.
assumptions (3)
  • standard math Shannon entropy and the grouping inequality H(grouped) <= H(individual) justify that merging can reduce total information.
    Used in Section 3.2, Eq. (5); subadditivity of entropy supports it but the paper does not prove it.
  • domain assumption Empirical probabilities from the training corpus approximate the true distribution of mesh token sequences.
    PTME and BPE statistics are computed from 10k meshes (Sections 3.3 and 4.1); the whole metric relies on this.
  • domain assumption Lower empirical entropy (PTME) makes the sequence easier for an autoregressive transformer to learn.
    Stated in Section 3.2; this is the load-bearing premise connecting PTME to generation quality.

how reviews work

0 comments
Cite this review

Pith. "Pith review of FreeMesh: Boosting Mesh Generation with Coordinates Merging." pith.science (2026). https://pith.science/paper/UXNGYAMW

@misc{pith2026250513573,
  author       = {Pith},
  title        = {Pith review of: FreeMesh: Boosting Mesh Generation with Coordinates Merging},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UXNGYAMW}},
  note         = {Machine review of arXiv:2505.13573}
}
read the original abstract

The next-coordinate prediction paradigm has emerged as the de facto standard in current auto-regressive mesh generation methods. Despite their effectiveness, there is no efficient measurement for the various tokenizers that serialize meshes into sequences. In this paper, we introduce a new metric Per-Token-Mesh-Entropy (PTME) to evaluate the existing mesh tokenizers theoretically without any training. Building upon PTME, we propose a plug-and-play tokenization technique called coordinate merging. It further improves the compression ratios of existing tokenizers by rearranging and merging the most frequent patterns of coordinates. Through experiments on various tokenization methods like MeshXL, MeshAnything V2, and Edgerunner, we further validate the performance of our method. We hope that the proposed PTME and coordinate merging can enhance the existing mesh tokenizers and guide the further development of native mesh generation.

Figures

Figures reproduced from arXiv: 2505.13573 by the authors.

Figure 1
Figure 1. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Comparison of token length distribution between co￾ordinate merging techniques. while the baseline Merge Coor￾dinates (MC) method typically requires 2 coordinates per token representation, the Rearrange & Merging Coordinates (RMC) ap￾proach achieves more efficient compression, with most coordinates being represented by a single token. et al., 2022; Poole et al., 2022; Wang et al., 2023; Chen et al., 2023; Tang et al… view at source ↗
Figure 3
Figure 3. Coordinate Merging Pipeline. Given a mesh, we first select a mesh tokenizer to convert the 3D structure into a 1D coordinate sequence. This sequence then undergoes rule-based rearrangement followed by token merging using the Byte Pair Encoding (BPE) algorithm. This approach can significantly reduce the length of the sequence, enabling the poly generation model to generate meshes with more faces. The proposed tokeniz… view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Comparison on point-cloud conditional generation. The figure above shows the results of generating meshes conditioned on point clouds sampled from meshes with different face numbers. Using the RMC can significantly improve the quality of the topology and the stability …
Figure 5
Figure 5. Figure 5: Compression ratio comparison of tokenizers with co￾ordinate merging techniques. We systematically evaluate base￾line Merge Coordinates (MC) and Rearrange & Merge Coordinates (RMC) across varying vocabulary sizes. Both methods exhibit de￾creasing compression ratios with…
Figure 6
Figure 6. Figure 6: Usable Mesh number Comparison Across Serializa￾tion Methods and Their RMC Variants. The RMC approach significantly increases the number of admissible training samples through enhanced sequence compression. high token counts: RAW+MC (7688), AMT+MC (7893), and EDR+MC (80…
Figure 7
Figure 7. Figure 7: Comparative analysis of remesh approaches. Our method versus traditional remeshing techniques with 5k and 1k face targets. However, for some cases with complex structures, the generation method is not robust enough and is prone to damage. 12 [PITH_FULL_IMAGE:figures/f…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Nexus: Native Mesh Generation with Diffusion

    cs.CV 2026-07 conditional novelty 6.0 of 10

    Nexus replaces autoregressive mesh serialization with two coupled diffusion models — octree vertex generation and a latent topology generator — claiming stronger geometry and perceptual quality on Objaverse and Toys4K.

Reference graph

Works this paper leans on

41 extracted references · 14 canonical work pages · cited by 1 Pith paper

  1. [1]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION format.date year duplicate empty "emp...

  2. [2]

    Character-level language modeling with deeper self-attention

    Al - Rfou, R., Choe, D., Constant, N., Guo, M., and Jones, L. Character-level language modeling with deeper self-attention. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Inte...

    work page 2019

  3. [3]

    X., Funkhouser, T., Guibas, L., Hanrahan, P., Huang, Q., Li, Z., Savarese, S., Savva, M., Song, S., Su, H., et al

    Chang, A. X., Funkhouser, T., Guibas, L., Hanrahan, P., Huang, Q., Li, Z., Savarese, S., Savva, M., Song, S., Su, H., et al. Shapenet: An information-rich 3d model repository. arXiv preprint arXiv:1512.03012, 2015

    arXiv 2015

  4. [4]

    Meshxl: Neural coordinate field for generative 3d foundation models

    Chen, S., Chen, X., Pang, A., Zeng, X., Cheng, W., Fu, Y., Yin, F., Wang, Y., Wang, Z., Zhang, C., et al. Meshxl: Neural coordinate field for generative 3d foundation models. arXiv preprint arXiv:2405.20853, 2024 a

    arXiv 2024

  5. [5]

    Meshanything: Artist-created mesh generation with autoregressive transformers, 2024 b

    Chen, Y., He, T., Huang, D., Ye, W., Chen, S., Tang, J., Chen, X., Cai, Z., Yang, L., Yu, G., Lin, G., and Zhang, C. Meshanything: Artist-created mesh generation with autoregressive transformers, 2024 b

    work page 2024

  6. [6]

    Meshanything v2: Artist-created mesh generation with adjacent mesh tokenization

    Chen, Y., Wang, Y., Luo, Y., Wang, Z., Chen, Z., Zhu, J., Zhang, C., and Lin, G. Meshanything v2: Artist-created mesh generation with adjacent mesh tokenization. arXiv preprint arXiv:2408.02555, 2024 c

    arXiv 2024

  7. [7]

    Text-to-3d using gaussian splatting

    Chen, Z., Wang, F., and Liu, H. Text-to-3d using gaussian splatting. arXiv preprint arXiv:2309.16585, pp.\ 21401--21412, 2023

    arXiv 2023

  8. [8]

    3dtopia-xl: Scaling high-quality 3d asset generation via primitive diffusion

    Chen, Z., Tang, J., Dong, Y., Cao, Z., Hong, F., Lan, Y., Wang, T., Xie, H., Wu, T., Saito, S., et al. 3dtopia-xl: Scaling high-quality 3d asset generation via primitive diffusion. arXiv preprint arXiv:2409.12957, 2024 d

    arXiv 2024

Show all 41 references
  1. [9]

    Objaverse: A universe of annotated 3d objects

    Deitke, M., Schwenk, D., Salvador, J., Weihs, L., Michel, O., VanderBilt, E., Schmidt, L., Ehsani, K., Kembhavi, A., and Farhadi, A. Objaverse: A universe of annotated 3d objects. In CVPR, pp.\ 13142--13153, 2023

    2023

  2. [10]

    Y., et al

    Deitke, M., Liu, R., Wallingford, M., Ngo, H., Michel, O., Kusupati, A., Fan, A., Laforte, C., Voleti, V., Gadre, S. Y., et al. Objaverse-xl: A universe of 10m+ 3d objects. Advances in Neural Information Processing Systems, 36, 2024

    2024

  3. [11]

    3d-future: 3d furniture shape with texture

    Fu, H., Jia, R., Gao, L., Gong, M., Zhao, B., Maybank, S., and Tao, D. 3d-future: 3d furniture shape with texture. International Journal of Computer Vision, 129: 0 3313--3337, 2021

    2021

  4. [12]

    W., Lin, T.-Y., and Liu, M.-Y

    Hao, Z., Romero, D. W., Lin, T.-Y., and Liu, M.-Y. Meshtron: High-fidelity, artist-like 3d mesh generation at scale. arXiv preprint arXiv:2412.09548, 2024

    2024 arXiv

  5. [13]

    Lrm: Large reconstruction model for single image to 3d

    Hong, Y., Zhang, K., Gu, J., Bi, S., Zhou, Y., Liu, D., Liu, F., Sunkavalli, K., Bui, T., and Tan, H. Lrm: Large reconstruction model for single image to 3d. arXiv preprint arXiv:2311.04400, 2023

    2023 arXiv

  6. [14]

    T., and et al

    Jain, A., Mildenhall, B., Barron, J. T., and et al. Zero-shot text-guided object generation with dream fields. In CVPR 2022, pp.\ 867--876, 2022

    2022

  7. [15]

    Kingma, D. P. Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114, 2013

    2013 arXiv

  8. [16]

    and Richardson, J

    Kudo, T. and Richardson, J. Sentencepiece: A simple and language independent subword tokenizer and detokenizer for neural text processing. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pp.\ 66--71, 2018

    2018

  9. [17]

    Wonder3d: Single image to 3d using cross-domain diffusion

    Long, X., Guo, Y.-C., Lin, C., Liu, Y., Dou, Z., Liu, L., Ma, Y., Zhang, S.-H., Habermann, M., Theobalt, C., et al. Wonder3d: Single image to 3d using cross-domain diffusion. arXiv preprint arXiv:2310.15008, 2023

    2023 arXiv

  10. [18]

    and Hutter, F

    Loshchilov, I. and Hutter, F. Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101, 2017

    2017 arXiv

  11. [19]

    Byte latent transformer: Patches scale better than tokens

    Pagnoni, A., Pasunuru, R., Rodriguez, P., Nguyen, J., Muller, B., Li, M., Zhou, C., Yu, L., Weston, J., Zettlemoyer, L., et al. Byte latent transformer: Patches scale better than tokens. arXiv preprint arXiv:2412.09871, 2024

    2024 arXiv

  12. [20]

    T., and Mildenhall, B

    Poole, B., Jain, A., Barron, J. T., and Mildenhall, B. Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988, 2022

    2022 arXiv

  13. [21]

    Neural machine translation of rare words with subword units

    Sennrich, R., Haddow, B., and Birch, A. Neural machine translation of rare words with subword units. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp.\ 1715--1725, 2016

    2016

  14. [22]

    Shannon, C. E. A mathematical theory of communication. The Bell System Technical Journal, 27 0 (3): 0 379--423, 1948. doi:10.1002/j.1538-7305.1948.tb01338.x

    1948

  15. [23]

    Meshgpt: Generating triangle meshes with decoder-only transformers

    Siddiqui, Y., Alliegro, A., Artemov, A., Tommasi, T., Sirigatti, D., Rosov, V., Dai, A., and Nie ner, M. Meshgpt: Generating triangle meshes with decoder-only transformers. arXiv preprint arXiv:2311.15475, 2023

    2023 arXiv

  16. [24]

    Minimum entropy principle (ii): Construction of the vocabulary, Apr 2018

    Su, J. Minimum entropy principle (ii): Construction of the vocabulary, Apr 2018. URL https://spaces.ac.cn/archives/5476

    2018

  17. [25]

    Dreamgaussian: Generative gaussian splatting for efficient 3d content creation

    Tang, J., Ren, J., Zhou, H., Liu, Z., and Zeng, G. Dreamgaussian: Generative gaussian splatting for efficient 3d content creation. arXiv preprint arXiv:2309.16653, 2023

    2023 arXiv

  18. [26]

    Edgerunner: Auto-regressive auto-encoder for artistic mesh generation

    Tang, J., Li, Z., Hao, Z., Liu, X., Zeng, G., Liu, M.-Y., and Zhang, Q. Edgerunner: Auto-regressive auto-encoder for artistic mesh generation. arXiv preprint arXiv:2409.18114, 2024 a

    2024 arXiv

  19. [27]

    Mvdiffusion++: A dense high-resolution multi-view diffusion model for single or sparse-view 3d object reconstruction

    Tang, S., Chen, J., Wang, D., Tang, C., Zhang, F., Fan, Y., Chandra, V., Furukawa, Y., and Ranjan, R. Mvdiffusion++: A dense high-resolution multi-view diffusion model for single or sparse-view 3d object reconstruction. arXiv preprint arXiv:2402.12712, 2024 b

    2024 arXiv

  20. [28]

    Team, T. H. Hunyuan3d 2.0: Scaling diffusion models for high resolution textured 3d assets generation, 2025

    2025

  21. [29]

    Prolificdreamer: High-fidelity and diverse text-to-3d generation with variational score distillation

    Wang, Z., Lu, C., Wang, Y., Bao, F., Li, C., Su, H., and Zhu, J. Prolificdreamer: High-fidelity and diverse text-to-3d generation with variational score distillation. arXiv preprint arXiv:2305.16213, 2023

    2023 arXiv

  22. [30]

    Meshlrm: Large reconstruction model for high-quality mesh

    Wei, X., Zhang, K., Bi, S., Tan, H., Luan, F., Deschaintre, V., Sunkavalli, K., Su, H., and Xu, Z. Meshlrm: Large reconstruction model for high-quality mesh. arXiv preprint arXiv:2404.12385, 2024

    2024 arXiv

  23. [31]

    Pivotmesh: Generic 3d mesh generation via pivot vertices guidance

    Weng, H., Wang, Y., Zhang, T., Chen, C., and Zhu, J. Pivotmesh: Generic 3d mesh generation via pivot vertices guidance. arXiv preprint arXiv:2405.16890, 2024 a

    2024 arXiv

  24. [32]

    Scaling mesh generation via compressive tokenization

    Weng, H., Zhao, Z., Lei, B., Yang, X., Liu, J., Lai, Z., Chen, Z., Liu, Y., Jiang, J., Guo, C., et al. Scaling mesh generation via compressive tokenization. arXiv preprint arXiv:2411.07025, 2024 b

    2024 arXiv

  25. [33]

    Vocabulary learning via optimal transport for neural machine translation

    Xu, J., Zhou, H., Gan, C., Zheng, Z., and Li, L. Vocabulary learning via optimal transport for neural machine translation. arXiv preprint arXiv:2012.15671, 2020

    2012 arXiv

  26. [34]

    Instantmesh: Efficient 3d mesh generation from a single image with sparse-view large reconstruction models

    Xu, J., Cheng, W., Gao, Y., Wang, X., Gao, S., and Shan, Y. Instantmesh: Efficient 3d mesh generation from a single image with sparse-view large reconstruction models. arXiv preprint arXiv:2404.07191, 2024

    2024 arXiv

  27. [35]

    Hunyuan3d-1.0: A unified framework for text-to-3d and image-to-3d generation

    Yang, X., Shi, H., Zhang, B., Yang, F., Wang, J., Zhao, H., Liu, X., Wang, X., Lin, Q., Yu, J., et al. Hunyuan3d-1.0: A unified framework for text-to-3d and image-to-3d generation. arXiv preprint arXiv:2411.02293, 2024

    2024 arXiv

  28. [36]

    Paint3d: Paint anything 3d with lighting-less texture diffusion models

    Zeng, X., Chen, X., Qi, Z., Liu, W., Zhao, Z., Wang, Z., Fu, B., Liu, Y., and Yu, G. Paint3d: Paint anything 3d with lighting-less texture diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp.\ 4252--4262, 2024

    2024

  29. [37]

    Clay: A controllable large-scale generative model for creating high-quality 3d assets

    Zhang, L., Wang, Z., Zhang, Q., Qiu, Q., Pang, A., Jiang, H., Yang, W., Xu, L., and Yu, J. Clay: A controllable large-scale generative model for creating high-quality 3d assets. ACM Transactions on Graphics (TOG), 43 0 (4): 0 1--20, 2024

    2024

  30. [38]

    Di-pcg: Diffusion-based efficient inverse procedural content generation for high-quality 3d asset creation

    Zhao, W., Cao, Y.-P., Xu, J., Dong, Y., and Shan, Y. Di-pcg: Diffusion-based efficient inverse procedural content generation for high-quality 3d asset creation. arXiv preprint arXiv:2412.15200, 2024 a

    2024 arXiv

  31. [39]

    Recurrent neural network for text classification with hierarchical multiscale dense connections

    Zhao, Y., Shen, Y., and Yao, J. Recurrent neural network for text classification with hierarchical multiscale dense connections. In Kraus, S. (ed.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-...

    2019

  32. [40]

    Michelangelo: Conditional 3d shape generation based on shape-image-text aligned latent representation

    Zhao, Z., Liu, W., Chen, X., Zeng, X., Wang, R., Cheng, P., Fu, B., Chen, T., Yu, G., and Gao, S. Michelangelo: Conditional 3d shape generation based on shape-image-text aligned latent representation. Advances in Neural Information Processing Systems, 36, 2024 b

    2024

  33. [41]

    Hunyuan3d 2.0: Scaling diffusion models for high resolution textured 3d assets generation

    Zhao, Z., Lai, Z., Lin, Q., Zhao, Y., Liu, H., Yang, S., Feng, Y., Yang, M., Zhang, S., Yang, X., et al. Hunyuan3d 2.0: Scaling diffusion models for high resolution textured 3d assets generation. arXiv preprint arXiv:2501.12202, 2025

    2025 arXiv

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.