Nicolas Calimet <pov### [at] freefr> wrote:
: 	Just a little thought, because I do not have any good knowledge about
: tesselation. How difficult would it be to implement a Delaunay-based method,
: compared to the one Warp used in his patch ?

  I have been thinking about using the marching triangles algorithm in the
tesselation patch, as I think it gives much better results than marching
cubes/tetrahedrons. However, it requires me to study how it works and how
it is implemented...

-- 
#macro N(D,I)#if(I<6)cylinder{M()#local D[I]=div(D[I],104);M().5,2pigment{
rgb M()}}N(D,(D[I]>99?I:I+1))#end#end#macro M()<mod(D[I],13)-6,mod(div(D[I
],13),8)-3,10>#end blob{N(array[6]{11117333955,
7382340,3358,3900569407,970,4254934330},0)}//                     - Warp -

Post a reply to this message