One of my courses in first semester of postgraduate study was called Geometrical Homology. It is a mathematical course that tries to connect mathematicians and computer scientists.
Part of assignment was also to implement algorithms that are described in chapter 7 of the following book:
Zomorodian, A. J., Ablowitz, M. J., Davis, S. H., Hinch, E. J.,
Iserles, A., Ockendon, J., and Olver, P. J. 2005 Topology for Computing
(Cambridge Monographs on Applied and Computational Mathematics).
Cambridge University Press.
You can find all other details if you get the source with README from SVN repository.
We did it in Java and we decided to publish our results.
We presented our work at seminar (link).
The algorithms were programmed in Java 1.6. You can get sources from public SVN repository:
svn co http://svn.andrej.com/homology/
The algorithms were developed by Marko Toplak, Damjan Glad and me with a lot of help and supervision of our mentors Andrej Bauer and Neža Mramor Costa.
Part of assignment was also to implement algorithms that are described in chapter 7 of the following book:
Zomorodian, A. J., Ablowitz, M. J., Davis, S. H., Hinch, E. J.,
Iserles, A., Ockendon, J., and Olver, P. J. 2005 Topology for Computing
(Cambridge Monographs on Applied and Computational Mathematics).
Cambridge University Press.
You can find all other details if you get the source with README from SVN repository.
We did it in Java and we decided to publish our results.
We presented our work at seminar (link).
The algorithms were programmed in Java 1.6. You can get sources from public SVN repository:
svn co http://svn.andrej.com/homology/
The algorithms were developed by Marko Toplak, Damjan Glad and me with a lot of help and supervision of our mentors Andrej Bauer and Neža Mramor Costa.





