My project is actually to make 3D renderings from GPS data, so I
necessarily will have a large set of datapoints..  So what I need is a
refined algorithm.  I set up my program to test all possible triangles
against Delaunay's criteria.  If I could mathematically exclude some of
those triangles it would make a huge difference in running time.  Even if I
don't find a better algorithm in that sense, there are some other
improvements I can make... fewer variables, eliminate duplicate
calculations.  Shall see, shall see.

Nice looking sig-macro you have there.

RetroJ



"Warp" <war### [at] tagpovrayorg> wrote in message
news:3f47f9b2@news.povray.org...
> RetroJ <jjf### [at] earthlinknet> wrote:
> > It runs in O(n^4) time
>
>   So forget using any larger amount of points?-)
>
> -- 
> #macro N(D)#if(D>99)cylinder{M()#local D=div(D,104);M().5,2pigment{rgb
M()}}
> N(D)#end#end#macro M()<mod(D,13)-6mod(div(D,13)8)-3,10>#end blob{
> N(11117333955)N(4254934330)N(3900569407)N(7382340)N(3358)N(970)}//  -
Warp -

Post a reply to this message