Oineus v1.0

RESOURCE

Abstract

A library for multi-threaded computation of persistence diagrams. The algorithm for computing persistence diagrams in a lock-free manner was published in the 'Towards Lock-free Persistent Homology' (D. Morozov, A. Nigmetov, Brief Announcement: SPAA 2020); it scales better than the only other shared-memory parallel implementation of persistent homology computation PHAT. Library includes python bindings to compute persistence diagrams and their vectorizations for lower-star filtrations on grid data. It is intended to be used by scientists working on Topological Data Analysis and its applications in different areas.
Developers:
Nigmetov, Arnur [1] Morozov, Dmitriy [1]
  1. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
Release Date:
2021-04-01
Project Type:
Open Source, Publicly Available Repository
Software Type:
Scientific
Licenses:
BSD 3-clause "New" or "Revised" License
Sponsoring Org.:
Code ID:
53989
Site Accession Number:
2021-052
Research Org.:
Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
Country of Origin:
United States

RESOURCE

Citation Formats

Nigmetov, Arnur, and Morozov, Dmitriy. Oineus v1.0. Computer Software. https://github.com/grey-narn/oineus. USDOE. 01 Apr. 2021. Web. doi:10.11578/dc.20210407.1.
Nigmetov, Arnur, & Morozov, Dmitriy. (2021, April 01). Oineus v1.0. [Computer software]. https://github.com/grey-narn/oineus. https://doi.org/10.11578/dc.20210407.1.
Nigmetov, Arnur, and Morozov, Dmitriy. "Oineus v1.0." Computer software. April 01, 2021. https://github.com/grey-narn/oineus. https://doi.org/10.11578/dc.20210407.1.
@misc{ doecode_53989,
title = {Oineus v1.0},
author = {Nigmetov, Arnur and Morozov, Dmitriy},
abstractNote = {A library for multi-threaded computation of persistence diagrams. The algorithm for computing persistence diagrams in a lock-free manner was published in the 'Towards Lock-free Persistent Homology' (D. Morozov, A. Nigmetov, Brief Announcement: SPAA 2020); it scales better than the only other shared-memory parallel implementation of persistent homology computation PHAT. Library includes python bindings to compute persistence diagrams and their vectorizations for lower-star filtrations on grid data. It is intended to be used by scientists working on Topological Data Analysis and its applications in different areas.},
doi = {10.11578/dc.20210407.1},
url = {https://doi.org/10.11578/dc.20210407.1},
howpublished = {[Computer Software] \url{https://doi.org/10.11578/dc.20210407.1}},
year = {2021},
month = {apr}
}