Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!houxm!whuxl!whuxlm!akgua!gatech!seismo!umcp-cs!eneevax!phaedrus
From: phaedrus@eneevax.UUCP
Newsgroups: net.math,net.graphics
Subject: Finding the location of an N-dim point in a set of regions
Message-ID: <571@eneevax.UUCP>
Date: Fri, 14-Mar-86 09:24:18 EST
Article-I.D.: eneevax.571
Posted: Fri Mar 14 09:24:18 1986
Date-Received: Mon, 17-Mar-86 04:11:45 EST
Reply-To: phaedrus@eneevax.UUCP (Praveen Kumar)
Organization: EE Dept, Maryversity of Uniland
Lines: 19
Xref: watmath net.math:2973 net.graphics:1525


Okay, I have solved my problem but not *THE* problem.  That is, I didn't
need to ask that question for the problem I was trying to solve.  It
turns out that each of these regions are characterized by a particular
point.  I found this out after some more research. The regions are
defined such that if I find the shortest distance between a data point
and one of these characterization points then the data point is in that
particular region.

This problem seems to have generated a lot of interest.  I have had
about 25 responses asking how I defined the regions etc.  So, it would
be difficult for me to thank you all individually.  Here's a collective
thank you to everyone who attempted to help me.

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

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