Meshless Shape Optimization using Neural Networks and Partial Differential Equations on Graphs

Eloi Martinet, Leon Bungert
2/20/2025
math.NAcs.LGmath.OC

No confident code implementation found for this paper.

Abstract

Shape optimization involves the minimization of a cost function defined over a set of shapes, often governed by a partial differential equation (PDE). In the absence of closed-form solutions, one relies on numerical methods to approximate the solution. The level set method -- when coupled with the finite element method -- is one of the most versatile numerical shape optimization approaches but still suffers from the limitations of most mesh-based methods. In this work, we present a fully meshless level set framework that leverages neural networks to parameterize the level set function and employs the graph Laplacian to approximate the underlying PDE. Our approach enables precise computations of geometric quantities such as surface normals and curvature, and allows tackling optimization problems within the class of convex shapes.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{martinet2025meshless,
  title  = {Meshless Shape Optimization using Neural Networks and Partial Differential Equations on Graphs},
  author = {Eloi Martinet and Leon Bungert},
  year   = {2025},
  eprint = {2502.14821},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.14821v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.14821.svg)](https://codeofpaper.com/paper/2502.14821)

Discussion