Change search
ReferencesLink to record
Permanent link

Direct link
GAP persistence–a computational topology package for GAP
School of Computer Science, University of St Andrews.ORCID iD: 0000-0001-6322-7542
2012 (English)Conference paper (Refereed)
Abstract [en]

We introduce a recently built package for computing persistent homology within the computer algebra system gap. A native gap implementation of the persistent homology algorithm allows for easier access to the group-theoretic primitives in gap while simultaneously working on computational topology questions – enabling for instance the use of symmetry groups to study symmetric point clouds. The strongest innovation here is in the combination of persistent homology and point cloud algorithms with the group theoretic tools in gap. This package is different from the several existing homological algebra and simplicial topology packages already in gap: simpcomp, homalg, Hap, et c., in that the focus here is on point cloud topology, and not combinatorial complexes or homological algebra.

Place, publisher, year, edition, pages
2012. 43-46 p.
National Category
Computational Mathematics
URN: urn:nbn:se:kth:diva-150366OAI: diva2:742588
28th Annual ACM Symposium on Computational Geometry, June 17-20, 2012, University of North Carolina, Chapel Hill, USA

QC 20150211

Available from: 2014-09-02 Created: 2014-09-02 Last updated: 2015-02-11Bibliographically approved

Open Access in DiVA

No full text

Other links


Search in DiVA

By author/editor
Vejdemo-Johansson, Mikael
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 33 hits
ReferencesLink to record
Permanent link

Direct link