Re: A89: Re: Re: Landscape algorithm?
[Prev][Next][Index][Thread]
Re: A89: Re: Re: Landscape algorithm?
Um...Kaus...Could you explain this a bit better?
On Tue, 1 Feb 2000 16:32:12 -0600 "Kaus" <kaus@cybrzn.com> writes:
>
> On the subject of Landscape Algorithms: This would probably be
> overly hard
> to do in asm, but for C it would be fine. An interesting algorithm
> would be
> a recursive lind bender:
>
>
> A B
>
>
> A B
> C
>
>
> D
> A B
> C E
>
> ya see what I mean?
>
> Where it recursively takes interval (n,m) and picks a random point p
> in
> between. Then, if f(x) is the equation of the line between
> (n,f(n))-(m,f(m)), you take f(p)+ or - a random small value, and
> this is
> your actual new point (p,p`)
> the sets of points could be stored in two arrays, and just resort
> them using
> the x array at the end of each loop through the intervals.
>
> --kaus
>
>
>
>
>
------------------------------------------------------------
Cody Maggard
RavenLoft_15@juno.com
http://www.angelfire.com/tx3/RavenLoft15/ - Paradox Realm
________________________________________________________________
YOU'RE PAYING TOO MUCH FOR THE INTERNET!
Juno now offers FREE Internet Access!
Try it today - there's no risk! For your FREE software, visit:
http://dl.www.juno.com/get/tagj.
Follow-Ups: