Challenges in 3D Data Synthesis for Training Neural Networks on Topological Features

Dylan Peek, Matthew P. Skerritt, Siddharth Pritam, Stephan Chalup
11/7/2025
cs.CV

No confident code implementation found for this paper.

Abstract

Topological Data Analysis (TDA) involves techniques of analyzing the underlying structure and connectivity of data. However, traditional methods like persistent homology can be computationally demanding, motivating the development of neural network-based estimators capable of reducing computational overhead and inference time. A key barrier to advancing these methods is the lack of labeled 3D data with class distributions and diversity tailored specifically for supervised learning in TDA tasks. To address this, we introduce a novel approach for systematically generating labeled 3D datasets using the Repulsive Surface algorithm, allowing control over topological invariants, such as hole count. The resulting dataset offers varied geometry with topological labeling, making it suitable for training and benchmarking neural network estimators. This paper uses a synthetic 3D dataset to train a genus estimator network, created using a 3D convolutional transformer architecture. An observed decrease in accuracy as deformations increase highlights the role of not just topological complexity, but also geometric complexity, when training generalized estimators. This dataset fills a gap in labeled 3D datasets and generation for training and evaluating models and techniques for TDA.

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{peek2025challenges,
  title  = {Challenges in 3D Data Synthesis for Training Neural Networks on Topological Features},
  author = {Dylan Peek and Matthew P. Skerritt and Siddharth Pritam and Stephan Chalup},
  year   = {2025},
  eprint = {2511.04972},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.04972v1}
}

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/2511.04972.svg)](https://codeofpaper.com/paper/2511.04972)

Discussion