Metraipolis › archive › dc_1c8a35bdf984

Playing to Par: Reinforcement Learning for Provably Optimal Quadrilateral Block Decompositions — arXiv:2609.32146

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.32146
License (as archived)
CC0-1.0
Archived
2026-10-07T22:36:20.124Z
SHA-256 of the archived text
23231fc385364577295ba43cc16a829e73a771127373abdc939e337248d69ddf
Stable URL of this page
https://metraipolis.com/documento/dc_1c8a35bdf984

How to cite

Playing to Par: Reinforcement Learning for Provably Optimal Quadrilateral Block Decompositions — arXiv:2609.32146 — arXiv (en), https://arxiv.org/abs/2609.32146 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1c8a35bdf984 (Metraipolis archive dc_1c8a35bdf984, sha256 23231fc385364577295ba43cc16a829e73a771127373abdc939e337248d69ddf)
BibTeX
@misc{dc1c8a35bdf984,
  title = {Playing to Par: Reinforcement Learning for Provably Optimal Quadrilateral Block Decompositions — arXiv:2609.32146},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.32146},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1c8a35bdf984; sha256 23231fc385364577295ba43cc16a829e73a771127373abdc939e337248d69ddf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32146. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A quadrilateral block decomposition of a planar domain is judged by whether it is complete, whether its elements are well shaped, and how many of its vertices are irregular. The last has a provable floor: the discrete Gauss-Bonnet identity enforces a lower bound on the total vertex irregularity of any all-quadrilateral mesh of a given domain purely based on its topology and corner angles. We train a reinforcement learning agent to build decompositions that reach this bound, which we call par. It acts directly on the mesh's half-edge data structure through local edits, with a policy network whose convolutions follow the mesh's own connectivity, so it applies unchanged to domains larger than any seen in training. The reward targets the floor directly, and it is sparse: random play reaches it on no domain with more than eight sides. We overcome this exploration barrier via behaviour cloning on optimal meshes that are trivial to construct, walked backward into demonstrations, before training it with PPO. On 96 held-out domains the agent produces an all-quadrilateral mesh on every one, a usable one on 95.7 on average, and a provably optimal one on 90; Gmsh's strongest configuration at the same element count completes 51, is usable on 38 and optimal on none, and even at three to fourteen times the elements never produces a more regular mesh. On 64 domains twice the training size the agent completes all, is usable on 62, and keeps a median excess over par below one against Gmsh's 39 at the same element count.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.32146 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T22:14:27.605Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).