opened
OlympioH
username_0
The build_thresh function takes a threshold parameter as input and build a proximity graph : an edge is in the proximity graph if the distance between two points is lower than the threshold value.It then checks for every simplex in the edges are in the proximity graph, and then computes the miniball of a simplex. The simplex is added iff the radius is lower than the given threshold. However it does not seem to accelerate the algorithm, maybe you can have some thoughts about it ? I know very little about CS and programming so there might be some stupid mistakes in the code, and call to functions unnecessarily costly.
Update cech.py
issue
created
ctralie
username_1
Hi, thanks for this!  I will have a look as soon as I can.

It depends on how this is written, but I wouldn't necessarily expect a
speedup in the Delaunay triangulation, but instead I might expect a speedup
in the filtration, since there will be fewer simplices.  So if you choose a
threshold such that many simplices are ignored, the filtration step (which
is often the bottleneck) should be faster
comment