Skip to content
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

Closed
davidcsterratt opened this issue Apr 28, 2017 · 1 comment
Closed

Use qhull for tsearchn() #6

davidcsterratt opened this issue Apr 28, 2017 · 1 comment
Assignees
Milestone

Comments

@davidcsterratt
Copy link
Owner

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).

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 davidcsterratt added this to the 0.4.0 milestone Apr 28, 2017
@davidcsterratt
Copy link
Owner Author

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.

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

No branches or pull requests

1 participant