- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies coarse quadrilateral block decomposition of planar domains. It uses a lower bound on total vertex-degree irregularity derived from the discrete Gauss-Bonnet identity as an optimality certificate: a valid all-quadrilateral mesh attaining this bound is optimal for that objective. The policy constructs meshes from the domain boundary through local DCEL edits, using half-edge convolutions that follow the mesh connectivity. Training begins with behavior cloning on demonstrations generated by working backward from constructible optimal meshes, followed by PPO. The evaluation procedure includes smoothing, multiple rollouts and repair, with an additional search for domains with curved boundaries. The reported results show low vertex irregularity and high completion rates on generated straight-sided domains, including larger instances and domains with holes, but performance is less consistent across larger domains with curved boundaries.
Critical strengths
1.The method performs well at generating coarse, regular block decompositions on the tested domains. Table 1 reports complete all-quadrilateral meshes for all 96 in-distribution domains, with mean counts of 95.7 usable meshes and 90.2 meshes at par across evaluation seeds. By comparison, Gmsh's quasi-structured method produces 96 usable meshes but reaches par on only two domains, while using approximately 3.2 times as many elements. These results are meaningful for applications where connectivity regularity and mesh coarseness matter. The certificate also provides a precise guarantee: valid meshes that reach par are optimal for the stated irregularity objective.
2.The experiments show a substantial benefit from the training recipe. In Table 9, behavior cloning followed by 1M PPO steps increases the mean number of in-distribution domains reaching par from 22.3 with cloning alone to 76.2. PPO trained from scratch for the same number of steps reaches par on only 7.2 domains. The paper also evaluates larger domains, domains with holes, and 48 held-out instances with nonzero par, reaching par on 47 of the latter. Together, these experiments provide strong evidence that combining certified demonstrations with subsequent reinforcement learning is effective beyond a small set of illustrative shapes.
Critical weaknesses
1.The contribution relative to the closest prior work is not sufficiently established. Narayanan et al. already define an irregularity lower bound, terminate when it is reached, and normalize returns by the remaining gap (arXiv:2309.06484). They also use DCEL-based convolutions combining cyclic-next and twin features, with a learnable boundary vector. For the same fixed desired-degree assignment, their bound coincides with the expression underlying par, by the Gauss-Bonnet identity. The present paper cites this work, and constructing meshes from a bare boundary, allowing non-quadrilateral intermediate states, and incorporating certified demonstrations and geometric quality are meaningful differences. However, Sections 1 and 7 should distinguish these changes more carefully from the existing mechanisms. More importantly, the external baselines are all Gmsh configurations; the closest learning-based method is not included. The reported comparisons therefore demonstrate advantages over the tested production meshers in obtaining coarse, regular decompositions, but do not establish the benefit of the proposed changes over the prior RL framework. This gap directly affects the assessment of the methodological contribution.
2.The curved-domain experiments do not separate the effects of search and candidate selection, and they show clear limitations in generalization. Table 2 reports that repair search increases the number of meshes meeting the tangent-based usability criterion from 74 to 95 out of 96, and the number reaching par from 19 to 37. However, Appendix L also describes a change in the selection criterion: the search procedure prioritizes regularity among usable candidates, whereas the no-search variant uses quality-first selection. The difference in at-par counts therefore cannot be attributed to additional search alone. A comparison using the same ranking rule is needed to separate these effects. The search can take up to 600 seconds per domain. Across the two larger curved-domain suites in Table 10, only 40 of 64 meshes meet the tangent-based usability criterion, and only two reach par. Although the paper acknowledges these limitations, they restrict how broadly the results can be interpreted as evidence of generalization by the learned policy. Separating the gains due to search from those due to candidate selection, and reporting the trade-off between runtime and quality, would make this claim more convincing.
Questions for authors
1.Clarify the incremental contribution relative to Narayanan et al. In particular, distinguish boundary-only construction and training on certified demonstrations from the lower-bound termination, normalized returns and DCEL convolutions already used in their framework. Can you provide a direct comparison on a common subset of domains? If there are substantive obstacles to such a comparison, please explain them and provide an appropriate controlled alternative.
2.Can you report the results with and without repair search on domains with curved boundaries under the same candidate-ranking rule, together with a summary of per-domain runtimes? How much of the observed improvement remains when the candidate-selection rule is held fixed?
Comparison to prior learning-based methods and updates on curved boundary handling
Thank you for the detailed review. We have included substantial updates to the manuscript based on the feedback, and changed text is marked in blue.
1. Contribution relative to Narayanan et al. (2024).
We agree that the paper should separate what it inherits from what is new. The revision now does so where appropriate and we summarize below.
nextandtwinpointers (Section 4). We generalise it from elements with a fixed number of sides to arbitrary polygonal faces.New in this work.
Direct comparison. We ran their trained quadrilateral agent, in the configuration of their Table 1, on our 96 in-distribution domains in its own pipeline (see Appendix D).
Head to head, our mesh is better on quality and regularity on 98% of decided domains. Their start meshes carry a median irregularity of 26 to 72 above their own bound, which is reduced to 2 to 4. Even measured against their own sub-optimal bound, they succeed on at most 44 of the 96 domains. The difference in element quality is much larger -- most of their meshes are not usable from a quality perspective. Appendix E compares the block structure each method's mesh implies, and Figure 7 shows the methods on one domain per family. Section 6.2 discusses which differences contribute to the gap.
2. Curved domains: search, candidate selection and runtime.
After submission we tried a simpler alternative to the test-time search: continuing to train the agent with PPO on a mixture of the straight-sided families and curved domains (Appendix F). It proved the better approach, so the revision removes the search and its repair strategy, and Section 6.4 now presents the curved-trained agent. Every agent is evaluated with the same procedure and candidate-ranking rule as Table 1, so the curved results no longer mix the effect of search with that of selection. The new Table 2:
Usable counts here judge quality against the arc tangents. Over six rollout seeds the curved-trained agent reaches par on 31.3 ± 0.9 of 96, and a second training seed gives 28.2. It wins on regularity on 98–100% of decided domains against every Gmsh configuration, and on tangent quality on 86–100%. The tradeoff is reduction in at-par on straight-sided domains from 90.3 to 81.0 of 96, noted as a limitation in Section 7.1, but we still remain the most regular method against all others compared by a significant margin.
Runtime. With no search, the procedure takes a median of 10 s per domain without holes and 17 s with holes on curved domains with 8–24 corners, single-threaded, and about a minute on the larger curved domains below.
Larger curved domains. We agree that these remain harder. On 96 domains with 25–50 corners, the curved-trained agent is usable on 90% and 83% of evaluations over three rollout seeds. Its median excess over par is 8 on both suites, against 25 to 117 for Gmsh at up to eight times the element count. Par is rare at this size for every method (Appendix F, Table 6).
Thank you again. The direct comparison and the controlled curved evaluation make the paper's claims more precise.