arXiv (All)
open access
Playing to Par: Reinforcement Learning for Provably Optimal Quadrilateral Block Decompositions
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 a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Exact volume computation for Boolean quadric polytopes of series-parallel graphs#1155669
- Official Review · ICLR 2024#787004
- Studies on Computational Learning via Discretization(Machine Learning and Data Mining,<Special Issue>Doctorial Theses on Artificial Intelligence)#478108
- Computational Algorithms for Invariant Reduction of Variational Forms#925558
- Sign-Separated Finite-Time Error Analysis of Q-Learning#192400
Record · ID 1116477
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive