Christopher James Huff <chr### [at] maccom> wrote:
: A collection of random points won't be so easy to connect together into 
: a surface...I don't think there is any foolproof algorithm to do that, 
: and all of the algorithms are pretty complex. It would probably be 
: better to stick with something more like marching tetrahedrons, or some 
: method that scans the surface.

  AFAIK the marching triangles algorithm is one of the best algorithms
for this purpose. I think that it generates nicely distributed triangles
(ie. you don't get extremely thin triangles, for exampe) and it can also
nicely calculate more triangles in highly curved parts. Besides, it's
completely free (not patented anywhere). Of course that doesn't mean it is
trivial.

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