- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
MeshExpand presents a framework for artistic mesh generation from oriented point clouds through learned local surface expansion. Starting from seed triangles, the model selects an open boundary edge and predicts an opposite vertex or a boundary token, conditioned on nearby faces, local point samples, and a global shape representation. An unordered local face representation removes the requirement for a fixed generation sequence, while geometric validation and resampling filter candidate triangles. The training procedure combines masked pretraining, randomized traversal contexts, and point-density conditioning. Experiments evaluate reconstruction quality, generalization, alternative growth orders, mesh completion, and memory usage.
Critical strengths
- A coherent local formulation that enables flexible mesh completion and editing. The model conditions on a bounded spatial neighborhood rather than a fixed global sequence prefix. This allows the same trained model to operate under different boundary-selection orders and continue generation from existing partial meshes. Tables 3 and 4 provide meaningful evidence for these capabilities. The bounded neural context also offers a clear architectural advantage for controlling per-step memory requirements as the output grows.
- Strong reported cross-domain results, supported by informative component ablations. On the combined GSO and Trellis evaluation in Table 1, MeshExpand achieves the best reported results across all five metrics. The ablations also identify substantial benefits from the training and validation components: removing MAE pretraining reduces normal consistency from 0.92 to 0.59, while geometric validation and resampling reduce the average numbers of self-intersecting faces and open boundaries from 6.3 to 0.41 and from 639.7 to 19.7, respectively. These results support the practical value of combining learned local prediction with geometric filtering.
Critical weaknesses
- The evaluation does not adequately distinguish geometric fidelity from mesh density or establish artistic mesh quality. Table 1 reports reconstruction metrics without output face counts or comparisons at matched mesh complexity, although MeshExpand explicitly controls resolution through input point density. The qualitative examples also raise the possibility that some improvements in geometric fidelity are obtained through denser triangulations. Without controlling for this factor, it is difficult to determine whether the gains reflect better mesh structure or a larger geometric approximation budget. This distinction is particularly important given the paper’s positioning as artistic mesh generation: low reconstruction error alone does not establish compactness, clean edge flow, or editability. The completion demonstrations and artist case study are useful, but do not resolve this ambiguity. Reporting quality–face-count trade-offs, together with topology-focused comparisons at comparable face counts, would better substantiate the claimed advantage for artistic mesh creation.
- The claims about artifact-free output exceed the demonstrated validity of the generated meshes. The conclusion states that geometric validation ensures artifact-free outputs. However, Table 2 reports an average of 0.41 self-intersecting faces and 19.7 open boundaries even on a subset whose reference meshes are watertight and self-intersection-free. These results demonstrate substantial defect reduction, but not artifact-free generation. Moreover, the paper does not report the fraction of completely valid outputs or separate measurements of vertex manifoldness and orientability. Since geometric validity is central to the proposed workflow, the remaining defects and the scope of the validation guarantees require clearer characterization.
Questions for authors
- Mesh density and artistic mesh quality Could you report the output face counts for the methods in Table 1 and clarify whether MeshExpand’s geometric advantages persist at comparable face counts? Some qualitative examples suggest that denser triangulations may contribute to the improved reconstruction fidelity. Given the paper’s emphasis on artistic meshes, what evidence demonstrates better compactness, edge flow, or editability beyond surface reconstruction accuracy? A comparison at matched face counts would help distinguish improved mesh structure from increased geometric resolution.
- Geometric validity and residual defects Table 2 reports residual self-intersections and open boundaries despite online geometric validation. Could you explain why these defects remain, particularly whether the generation-time and evaluation-time intersection checks use different tolerances or adjacency rules? Does the non-manifold check cover vertex manifoldness as well as edge manifoldness? If available, please report the fraction of outputs that are simultaneously manifold, watertight, and self-intersection-free on the closed-surface evaluation subset. This would clarify the practical reliability and scope of the validation mechanism.
2 comments
Thank you for the response and the revision. The added face counts, the Ours-Low setting, the extended Table 2, and the revised conclusion address most of my concerns. In particular, MeshExpand outperforming baselines with 24k–32k faces on GSO+Trellis while using 12k–19k resolves the density question for geometric fidelity, and the scope of the validity guarantees is now clear.
A few points for the final version:
- On GSO+Trellis, θ is 16.9° versus 12.7° for Advancing Front, and degrades from 10.0° on Objaverse. This should be discussed, and the claims about artistic quality on out-of-distribution inputs scoped accordingly. Please also unify the units of θ in Tables 1 and 4.
- Ours-Low is worse than MeshAnything V2 and BPT on HD, so "outperforms" should be qualified.
- Please report the subset sizes for Tables 2 and 4, and state the 22% watertight / 20% fully valid rates as a limitation.
I am raising my rating to 3.
Q1: Face-budget-controlled Comparisons. We have added face-budget-controlled comparisons on Objaverse in Table 1. Our default setting uses a face budget (2.5k) comparable to the ground-truth (2.6k) and lower than most of the baselines. With a reduced budget of 1.7K faces(Ours-Low), MeshExpand still outperforms MeshAnything V2 and BPT under comparable budgets. These results demonstrate that MeshExpand's geometric advantages are not attributable to denser triangulations, but from more effective triangle placement and organization. To evaluate mesh structure beyond geometric accuracy, we introduce an edge-flow orthogonality metric in Table 1, along with additional topological metrics in Tables 2 and 4. These complementary evaluations provide evidence of comparable edge-flow and improved topological validity beyond surface reconstruction accuracy.
Q2: (1) Self-intersection. During inference, we use a self-implemented 1-to-N single-direction test, whereas the results in Table 2 are obtained using a bidirectional N-to-N intersection test. The small non-zero discrepancies are primarily attributed to floating-point numerical instability in our implementation, intersect(a,b)!=intersect(b,a). (2) Manifoldness. Our half-edge-based construction enforces edge manifoldness and consistent face orientations. Vertex manifoldness is not explicitly checked during generation for efficiency, but non-manifold vertices are easier to repair through vertex splitting. (3) Topological metrics. We report the percentages of orientable and watertight meshes, along with the average numbers of non-manifold vertices and edges in Table 2 and Table 4. MeshExpand achieves approximately 75% watertightness in mesh completion and 22% in mesh generation. Notably, 20% of MeshExpand outputs in generation are simultaneously manifold, watertight, and self-intersection-free, doubling DeepMesh's 10%. Among the remaining non-watertight meshes, MeshExpand significantly reduces the number of their boundary edges, indicating fewer and/or smaller holes and thus less manual effort for subsequent repair.