jPlex
JPlex is a software package for computing persistent homology of finite simplicial complexes, often generated from point cloud data. This is the third of four versions of Plex, and because it is written in Java it is often referred to as JPlex. JPlex can be run in Matlab or in a standalone mode, using an integrated Java interpreter called Beanshell (our thanks to the author, Patrick Niemeyer, for allowing us to repackage the interpreter with our library). The initial goals of this rewrite were to fix several longstanding memory management problems and to make installation easy. These goals were met, but our experience is that JPlex is also faster and capable of running larger cases than the previous versions. The complete library is in a single jar file that is currently less than .5 megabytes, including the Beanshell interpreter, and requires no compilation. You must, however, have access to a version 1.5 or later java runtime, either through Matlab or directly through a command line. This is explained in more detail either in the tutorials or in the online documentation
Keywords for this software
References in zbMATH (referenced in 10 articles )
Showing results 1 to 10 of 10.
Sorted by year (- Schweinhart, Benjamin: Persistent homology and the upper box dimension (2021)
- Gonzalez, Georgina; Ushakova, Arina; Sazdanovic, Radmila; Arsuaga, Javier: Prediction in cancer genomics using topological signatures and machine learning (2020)
- Mémoli, Facundo; Singhal, Kritika: A primer on persistent homology of finite metric spaces (2019)
- Alonso Rodríguez, Ana; Bertolazzi, Enrico; Ghiloni, Riccardo; Specogna, Ruben: Efficient construction of 2-chains representing a basis of (H_2(\overline\Omega, \partial\Omega; \mathbbZ)) (2018)
- Bubenik, Peter; Dłotko, Paweł: A persistence landscapes toolbox for topological statistics (2017)
- Adams, Henry; Tausz, Andrew; Vejdemo-Johansson, Mikael: Javaplex: a research software package for persistent (co)homology (2014)
- Boissonnat, Jean-Daniel; Maria, Clément: The simplex tree: an efficient data structure for general simplicial complexes (2014)
- Pellikka, M.; Suuriniemi, S.; Kettunen, L.; Geuzaine, C.: Homology and cohomology computation in finite element modeling (2013)
- Galtier, Mathieu N.; Faugeras, Olivier D.; Bressloff, Paul C.: Hebbian learning of recurrent connections: a geometrical perspective (2012)
- de Silva, Vin; Morozov, Dmitriy; Vejdemo-Johansson, Mikael: Persistent cohomology and circular coordinates (2011)