Skip to main navigation Skip to search Skip to main content

Persistent Homology on GPU for 1d and 2d Cubical Filtrations

  • Laboratoire de Mathématiques d'Orsay

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper describes the algorithmic choices made in a pure GPU implementation to compute persistent homology for cubical complexes in dimension 1 or 2. The main ingredients are the parallel detection of apparent pairs, the simple reduction of the remaining complex when we only consider H0, and the possibility to iterate those two steps. The result can be 200 times faster than a sequential CPU implementation.

Original languageEnglish
Title of host publication34th Annual European Symposium on Algorithms, ESA 2026
EditorsPhilip Bille, Seth Pettie, Sabine Storand
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959774451
DOIs
Publication statusPublished - 25 Aug 2026
Externally publishedYes
Event34th Annual European Symposium on Algorithms, ESA 2026 - L�Aquila, Italy
Duration: 31 Aug 2026 → 4 Sept 2026

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume388
ISSN (Print)1868-8969

Conference

Conference34th Annual European Symposium on Algorithms, ESA 2026
Country/TerritoryItaly
CityL�Aquila
Period31/08/26 → 4/09/26

Keywords

  • GPU
  • Persistent homology
  • cubical complex
  • parallelism

Fingerprint

Dive into the research topics of 'Persistent Homology on GPU for 1d and 2d Cubical Filtrations'. Together they form a unique fingerprint.

Cite this