Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!seismo!umcp-cs!eneevax!phaedrus
From: phaedrus@eneevax.UUCP (Praveen Kumar)
Newsgroups: net.math,net.graphics
Subject: Finding the location of an N-dim pt. in set of regions
Message-ID: <564@eneevax.UUCP>
Date: Tue, 11-Mar-86 18:23:01 EST
Article-I.D.: eneevax.564
Posted: Tue Mar 11 18:23:01 1986
Date-Received: Fri, 14-Mar-86 05:48:41 EST
Reply-To: phaedrus@eneevax.UUCP (Praveen Kumar)
Organization: EE Dept, Maryversity of Uniland
Lines: 25
Xref: watmath net.math:2953 net.graphics:1522


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