Implementation of qh_findbestfacet / find_simplex

Is it possible to implement the qh_findbestfacet / find_simplex function in MiniQhull? This would make it easy to do fast, linear interpolations from discrete, unstructured data points in 3 dimensions.

I am using Delaunay triangulation for creating an interpolating, continuous function from discrete data points in a vector field of flow velocity in time and two spatial dimensions. Presently, I am using Python for this (the workhorse is scipy.spatial.Delaunay.find_simplex), but I have been thinking of transferring the project to Julia. If this was made in Julia, do you think it would be faster than the Python version? Or would the function depend more on the efficiency of the underlying, original C function (qh_findbestfacet) from the Qhull library anyway?