
Re: Simplex Representation
This implies the largest number of 0dimensional simplices Dionysus can handle is the highest integer representation of an unsigned long int?
This implies the largest number of 0dimensional simplices Dionysus can handle is the highest integer representation of an unsigned long int?

By
tom
·
#162
·


Re: Simplex Representation
Well, that's a very weak upper bound, since that number is astronomical. The actual computer memory is a far stronger limitation.
Well, that's a very weak upper bound, since that number is astronomical. The actual computer memory is a far stronger limitation.

By
Dmitriy Morozov
·
#163
·


Difference between R TDA package and python Dionysus2
I've just been comparing the output between the Dionysus version in the TDA package in R and the python Dionysus 2 version and there are slightly different results.
I ran it on both sub and super
I've just been comparing the output between the Dionysus version in the TDA package in R and the python Dionysus 2 version and there are slightly different results.
I ran it on both sub and super

By
K.A.Garside2@...
·
#164
·


Re: Difference between R TDA package and python Dionysus2
I don't know what the R package does, but if I had to guess, the two are using different triangulations of the domain. Dionysus 2 uses the Freudenthal triangulation; I don't know what the R package
I don't know what the R package does, but if I had to guess, the two are using different triangulations of the domain. Dionysus 2 uses the Freudenthal triangulation; I don't know what the R package

By
Dmitriy Morozov
·
#165
·


Re: Difference between R TDA package and python Dionysus2
The R package states that it uses Dionysus as a library however? I assume that means it is not using Dionysus 2?
" For that, this package provides an R interface for the efficient algorithms of the
The R package states that it uses Dionysus as a library however? I assume that means it is not using Dionysus 2?
" For that, this package provides an R interface for the efficient algorithms of the

By
K.A.Garside2@...
·
#166
·


Re: Difference between R TDA package and python Dionysus2
The R package uses Dionysus 1, for sure. Dionysus 1 doesn't have any code to construct triangulations on grids: it's left to the user. How the R package implements this step is a question for its
The R package uses Dionysus 1, for sure. Dionysus 1 doesn't have any code to construct triangulations on grids: it's left to the user. How the R package implements this step is a question for its

By
Dmitriy Morozov
·
#167
·


Re: Persistentbased segmentation
I think you'll have to explain better what you are trying to do before I can help you.
You can get cycles (which are not unique) from Dionysus. That question has come up before on this list. For
I think you'll have to explain better what you are trying to do before I can help you.
You can get cycles (which are not unique) from Dionysus. That question has come up before on this list. For

By
Dmitriy Morozov
·
#169
·


Build Under Windows
I've spent some time trying to get Dionysus 2 to build under Windows. Here are my notes on getting it to build. The versions listed are the ones that I used and I have some notes on versions that
I've spent some time trying to get Dionysus 2 to build under Windows. Here are my notes on getting it to build. The versions listed are the ones that I used and I have some notes on versions that

By
micheal.shoemaker@...
·
#173
·


Re: Build Under Windows
This is fantastic. Thank you for these instructions. Building on Windows seems to be the most common question, and now we have this writeup to point people to.
Now if I could figure out how to get
This is fantastic. Thank you for these instructions. Building on Windows seems to be the most common question, and now we have this writeup to point people to.
Now if I could figure out how to get

By
Dmitriy Morozov
·
#174
·


Re: Persistentbased segmentation
Hi Dmitriy,
did you have any time to think about my question?
Thanks
Hi Dmitriy,
did you have any time to think about my question?
Thanks

By
Jack <giacomo@...>
·
#175
·


Re: Build Under Windows
I went back and looked more into the MinGW version issue 8.2.0 issue. Right now, I'm getting:
CMake Error at bindings/python/pybind11/tools/FindPythonLibsNew.cmake:122 (message):
Python config
I went back and looked more into the MinGW version issue 8.2.0 issue. Right now, I'm getting:
CMake Error at bindings/python/pybind11/tools/FindPythonLibsNew.cmake:122 (message):
Python config

By
micheal.shoemaker@...
·
#176
·


Re: Persistentbased segmentation
I don't really understand your question. The linked messages give a way to get actual cycles (for example, sequences of edges, not just births/deaths). Do you want to do something else?
But I'm really
I don't really understand your question. The linked messages give a way to get actual cycles (for example, sequences of edges, not just births/deaths). Do you want to do something else?
But I'm really

By
Dmitriy Morozov
·
#177
·


Re: Build Under Windows
Ah, I see. So it's an issue with the distribution of MinGW. That makes sense, and not something that we can fix.
Thanks again for figuring all this out.
Dmitriy
Ah, I see. So it's an issue with the distribution of MinGW. That makes sense, and not something that we can fix.
Thanks again for figuring all this out.
Dmitriy

By
Dmitriy Morozov
·
#178
·


Wasserstein or Bottleneck Mapping
Hi Dmitriy,
Is it possible to obtain, using the library, the optimal mapping of points for either the bottleneck or wasserstein distance?
Thanks!
Hi Dmitriy,
Is it possible to obtain, using the library, the optimal mapping of points for either the bottleneck or wasserstein distance?
Thanks!

By
K.A.Garside2@...
·
#179
·


Re: Wasserstein or Bottleneck Mapping
In the case of the bottleneck distance, only the longest edge is uniquely defined  there are many matchings that satisfy the constraints. There is a pull request [1] that provides a way to get this
In the case of the bottleneck distance, only the longest edge is uniquely defined  there are many matchings that satisfy the constraints. There is a pull request [1] that provides a way to get this

By
Dmitriy Morozov
·
#180
·


representatives of bars, homology classes
Greetings,
Say I've computed persistent homology of some RIPS complex in Dionysus. How does one go the extra step to find a cycle representative in a homology class? i.e. I would like to identify
Greetings,
Say I've computed persistent homology of some RIPS complex in Dionysus. How does one go the extra step to find a cycle representative in a homology class? i.e. I would like to identify

By
Ryan Budney
·
#181
·


representatives of bars, homology classes. . . perhaps with better formatting
Greetings,
Say I've computed persistent homology of some RIPS complex in Dionysus. How does one go the extra step to find a cycle representative in a homology class? i.e. I would like to identify
Greetings,
Say I've computed persistent homology of some RIPS complex in Dionysus. How does one go the extra step to find a cycle representative in a homology class? i.e. I would like to identify

By
Ryan Budney
·
#182
·


Re: representatives of bars, homology classes. . . perhaps with better formatting
Hi Ryan,
Your understanding is correct. I just want to add a couple of small things.
That's right. If there is nothing to the right of the colon (i.e., if the respective column c (=hfp[i]) is empty),
Hi Ryan,
Your understanding is correct. I just want to add a couple of small things.
That's right. If there is nothing to the right of the colon (i.e., if the respective column c (=hfp[i]) is empty),

By
Dmitriy Morozov
·
#183
·


Homology groups for paths on 8connected grids
Hi!
I've been playing around with this library and after going through the (great) documentation for it, I'm still stuck trying to implement what I believe to be rather basic: evaluate path homologies
Hi!
I've been playing around with this library and after going through the (great) documentation for it, I'm still stuck trying to implement what I believe to be rather basic: evaluate path homologies

By
o.lamarre7@...
·
#184
·


Re: Homology groups for paths on 8connected grids
The chains should be defined in terms of the indices in the filtration. Each entry should be a tuple of coefficient and index. So to make your code work, change the chain definitions to:
chain_red =
The chains should be defined in terms of the indices in the filtration. Each entry should be a tuple of coefficient and index. So to make your code work, change the chain definitions to:
chain_red =

By
Dmitriy Morozov
·
#185
·
