[OctDev] New tsearchn.m function

[Pedro T. <pt...@te...>]

Hello,

I just finished a new tsearchn.m function. It is the n-dimensional equivalent 
of tsearch.

I'm not very happy with this implementation for this two reasons:

-It's an -m- file, so it's performance is not very good. I think this should 
be implemented as an .oct function. Maybe in the future if I get desperate 
enough.

-The speed could be improved in some cases if it were possible to check if the 
points lie within the tesselation a priori. I can do that finding the convex 
hull of X along with its normals and offsets (hyperplane equations). I wrote 
time ago a qhull.oct function that allows to do that but since it's not in 
octave-forge I didn't include this procedure. This means that if many points 
don't belong to the tesselation the computing time can be long.

Anyway, here's what I wrote and what I'm using. I can't commit to CVS so if 
someone is willing to do so, please, feel free.

I attach tsearchn.m and qhull.cc just in case someone likes it.

Regards,
Pedro