X-Mailer: Mozilla 3.01Gold (X11; I; SunOS 4.1.4 sun4m)
MIME-Version: 1.0
Subject: Re: A* question...
References: <33268E08.315CDBAD@hig.no> <33282936.59E2@eecs.umich.edu> <332B4DC7.6B07@nbnet.nb.ca> <332c78ec.176805258@la-news1.digilink.net> <332CA41A.108B@nbnet.nb.ca> <5gie6q$ufa@camel2.mindspring.com>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Path: cantaloupe.srv.cs.cmu.edu!nntp.club.cc.cmu.edu!goldenapple.srv.cs.cmu.edu!das-news2.harvard.edu!cam-news-feed3.bbnplanet.com!cam-news-hub1.bbnplanet.com!cpk-news-hub1.bbnplanet.com!news.bbnplanet.com!newsfeed.nacamar.de!nntp.uio.no!uninett.no!news.uni-c.dk!imada.ou.dk!breese
From: breese@imada.ou.dk (Bjorn Reese)
Message-ID: <1997Mar20.163943.7759@imada.ou.dk>
Sender: news@imada.ou.dk
Nntp-Posting-Host: langgaard.imada.ou.dk.imada.ou.dk
Organization: Dept. of Math. & Computer Science, Odense University, Denmark
Date: Thu, 20 Mar 1997 16:39:43 GMT
Lines: 13
Newsgroups: comp.ai.games

Bryan Stout wrote:
 
> several months from Addison-Wesley.)  In brief, ways to break a smooth space
> into a small amount of decision points include:

>  - dividing the space into convex polygons, & go from center to center (or
>      from one edge middle to another)

Since the purpose of the convex segmentation is to be able to "see"
neighbouring decision points, you would have to use the edges rather
than the centers.

This is actually one of the subjects of my thesis.
