New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Use qhull for tsearchn() #6
Comments
davidcsterratt
added a commit
that referenced
this issue
Apr 28, 2017
The code has been modified in a similar way to the C_convhulln() code, by adding a finalizer that cleans up the memory when the object is finally destroyed.
davidcsterratt
added a commit
that referenced
this issue
May 3, 2017
This doesn't give correct ids, as facet->id does not map to the order of the facet when iterating through FOREACHfacet. Probably the solution is to create a mapping by running through FOREACHfacet to create a hash from id to sequence in list. |
This was referenced May 3, 2017
davidcsterratt
added a commit
that referenced
this issue
Sep 12, 2017
davidcsterratt
added a commit
that referenced
this issue
Sep 19, 2017
davidcsterratt
added a commit
that referenced
this issue
Sep 19, 2017
davidcsterratt
added a commit
that referenced
this issue
Sep 24, 2017
davidcsterratt
added a commit
that referenced
this issue
Feb 17, 2019
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
At present, the implementation of tsearchn() involves, for each point, testing if it is in every facet. A more efficient method would use qh_findbestfacet() (as in findDelaunay() in https://github.com/qhull/qhull/blob/master/src/user_eg/user_eg_r.c).
The text was updated successfully, but these errors were encountered: