Metadata-Version: 2.1
Name: chromatic-tda
Version: 1.0.2
Summary: Tool to compute six-packs of persistence diagrams for chromatic point clouds
Home-page: https://github.com/OnDraganov/chromatic-tda
License: AGPL-3.0-or-later
Keywords: tda,topological data analysis,chromatic,chromatic alpha,delaunay,persistence,persistent homology
Author: Ondrej Draganov
Author-email: ondrej.draganov@ist.ac.at
Requires-Python: >=3.9,<3.13
Classifier: License :: OSI Approved :: GNU Affero General Public License v3 or later (AGPLv3+)
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.9
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.11
Requires-Dist: matplotlib (>=3.7.0,<4.0.0)
Requires-Dist: mypy (>=1.3.0,<2.0.0)
Requires-Dist: numpy (>=1.24.2,<2.0.0)
Requires-Dist: pytest (>=7.3.1,<8.0.0)
Requires-Dist: scipy (>=1.10.1,<2.0.0)
Project-URL: Documentation, https://github.com/OnDraganov/chromatic-tda
Project-URL: Repository, https://github.com/OnDraganov/chromatic-tda
Description-Content-Type: text/markdown

# chromatic_tda

`chromatic_tda` is a package for computing six-packs of persistent diagrams of colored point clouds. Currently point clouds in R^2 with 2 or 3 colors are supported (see Future).

# Installation

## Install with `pip`

The package is uploaded to [PyPI](https://pypi.org/project/chromatic-tda/), so it can be installed with `pip`.

Run `pip install chromatic_tda`.

## Install from github project

The project uses `poetry` for Python dependecy management, which allows you to easily install all you need to run the package:

- Clone the repository
- Install `poetry`
- Go to the repository folder in terminal
- Run `poetry shell`
- Run `poetry install`
- [optional] Run `pytest` to check that the code runs

# How to use

Check the jupyter notebook file `manual` to see how to use the code.

# !!! Warning !!!

In the current version there seems to be a bug: certain point-clouds show infinite class in cokernel, when there should not be any. We are working on the solution.

# Future

The code is under active developement. The future plans include:
- Adding support for points in R^3
- Making persistence computation faster with clearing.
- Add more details and examples about how to use the code.

# Publications

The code is based on research done at Institute of Science and Technology by Ranita Biswas, Sebastiano Cultrera di Montesano, Ondřej Draganov, Herbert Edelsbrunner and Morteza Saghafian. A draft write up can be found on [arxiv](https://arxiv.org/abs/2212.03128). An updated version is currently being written.

# Contact

If you have any questions to the code, do not hesitate to contat us. We are also eager to hear from you if you try the code out, and happy to chat about how you can use it on your data. Use, e.g., the mail in my [github profile](https://github.com/OnDraganov).

# License

Copyright ©2023. Institute of Science and Technology Austria (IST Austria). All Rights Reserved.  

This file is part of chromatic_tda, which is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or any later version.
 
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.
 
You should have received a copy of the GNU Affero General Public License along with this program. If not, see <https://www.gnu.org/licenses/>.
 
Contact the Technology Transfer Office, ISTA, Am Campus 1, A-3400 Klosterneuburg, Austria, +43-(0)2243 9000, twist@ist.ac.at, for commercial licensing opportunities.
