Skip to content

Conversation

@OlympioH
Copy link

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.

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
@ctralie
Copy link
Member

ctralie commented Oct 28, 2019 via email

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants