SearcharxivSearch

arXiv · 2504.03610

Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning

Abstract

In this work we introduce a triangular Delaunay mesh generator that can be trained using reinforcement learning to maximize a given mesh quality metric. Our mesh generator consists of a graph neural network that distributes and modifies vertices, and a standard Delaunay algorithm to triangulate the vertices. We explore various design choices and evaluate our mesh generator on various tasks including mesh generation, mesh improvement, and producing variable resolution meshes. The learned mesh generator outputs meshes that are comparable to those produced by Triangle and DistMesh, two popular Delaunay-based mesh generators.

Explore related subjects

Keep this discovery

BibTeXRIS

Will Thacher, Per-Olof Persson, Yulong Pan. 2026-08-31. Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning. https://doi.org/10.1016/j.cad.2025.103964

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Unfolding Overlaps of the Exceptional Regular Polytopes

We find explicit ridge unfoldings of the three exceptional 4D polytopes (24-cell, 120-cell, 600-cell) that result in overlaps of their facets. These failures bring an end to the full classification of regular polytopes with the all-net property.

cs.CG

Column Number of Delta-modular matrices: Refined Analysis via Sauer Matrices

In this paper, we build upon the analysis initiated by Gennadiy Averkov and Matthias Schymura (2022) and establish that the number of distinct columns of a $Δ$-modular matrix $A \in \mathbb{Z}^{m \times n}$ of rank $m$ is $O(m^3 Δ)$. This upper bound was previously known only for odd values of $Δ$. Recall that a matrix is called $Δ$-modular if the maximum of the absolute values of its $m \times m$ minors equals $Δ$.

math.CO

Distinguishing classes of intersection graphs of homothets or similarities of two convex disks

For smooth convex disks $A$, i.e., convex compact subsets of the plane with non-empty interior and with at most one tangent at every boundary point, we classify the classes $G^{\text{hom}}(A)$ and $G^{\text{sim}}(A)$ of intersection graphs that can be obtained from homothets and similarities of $A$, respectively. Namely, we prove that $G^{\text{hom}}(A)=G^{\text{hom}}(B)$ if and only if $A$ and $B$ are affine equivalent, and $G^{\text{sim}}(A)=G^{\text{sim}}(B)$ if and only if $A$ and $B$ are similar.

cs.CG