[net.math] Finding the location of an N-dim pt. in set of regions

phaedrus@eneevax.UUCP (Praveen Kumar) (03/12/86)

Problem:

	Given a set of N-dim regions and a point, which is guaranteed to
be in one of those regions, find an algorithm which will find the region
in which the point is located.

I need some help in solving this problem.  To put a ceiling on the problem,
I think N is around 8 to 10.  By the way, there will be many points - on
the order of 10,000 to 15,000, but it isn't real time.  So, the algorithm
has to be reasonably fast but needn't be *REAL* fast.  Also, the results
needn't be perfect.  In the sense that, I can tolerate distortion.

Am I trying to solve an unsolvable problem?  I don't have the math or CS
background to decide.

Please, send me mail.  I usually don't read this newsgroup.

Thanks,

praveen
-- 
"This ain't my goddamn planet, understand monkey-boy!"

phaedrus@eneevax.umd.edu or {seismo,allegra}!umcp-cs!eneevax!phaedrus