RetroJ <jjf### [at] earthlinknet> wrote:
>     My project is actually to make 3D renderings from GPS data, so I
> necessarily will have a large set of datapoints..

  I don't know anything about this type of algorithms, but I'm pretty
sure there must be a much faster than O(n^4) algorithm for this.
I would say that it's extremely rare that O(n^4) would be the fastest
you can do something related to a set of points.
  I very wild guess is that there exists sone O((n^2)*log n) or even O(n^2)
algorithm. It would make sense.
  OTOH, I think there are some matrix-handling algorithms which are O(n^3),
so it's not impossible that that would be the faster possible for this
problem as well.

-- 
#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