Periodic alpha complex with DTM filtration about gudhi-devel HOT 4 CLOSED

Hello,
if I understand correctly, you want to build an alpha-complex, in a periodic space, using as weights (as in a regular triangulation) the DTM at each vertex? You are going to need to code some pieces yourself to get the complete pipeline.

• computing the DTM: essentially, for each point, you need to find the distances to the k nearest neighbors (in the periodic metric). I would first try it brute-force (compute the distances to all the other points, then std::nth_element), and if that's too slow, I would look into using CGAL::Kd_tree with a custom query item (and possibly custom traits).
• compute the alpha-complex. If your data is in 3d, you can use Gudhi's Alpha_complex_3d (C++). In 2d, I think you can use CGAL, but extracting the filtration from Alpha_shape_2 is non-trivial. In other dimensions, you are out of luck.

from gudhi-devel.

Thanks for your guide!
It seems like I should construct periodic alpha complex first and then compute DTM value for each vertex and filtration value for each edge and add vertices and edges with corresponding filtration value to simplex tree?

from gudhi-devel.

Ah, it looks like you are going for what Raphaël Tinarrage calls alpha-DTM-filtration? Then note that you don't need an alpha-complex, just a Delaunay triangulation (i.e. you don't need filtration values if you are going to replace them with your own), though that doesn't change much in terms of code. Yes, what you suggest should work.

from gudhi-devel.

I understand. Thanks!

from gudhi-devel.