Jan Dvorak <jan### [at] centrumcz> wrote:

> if we assume no double edges(diangular faces)

.... or triple.

previous code patch:

stripfaces()

#while (h < n1+n2-1)
#while (h < n1+n2-1)

#if (n1 > 1) Edge_Arr[NumEdges] = <s1,e2>; ...
#if (n2 > 1) Edge_Arr[NumEdges] = <s2,e1>; ...
replaces
//#if (NumEdges < NumVertices*4)
//#if (NumEdges < NumVertices*4)

for last edge, where range1==1 or range2==1 then done, no quad left to disect

Some known method can check accuracy:
320:Verts == 636:Triangles == 954:Edges == 16:Stacks/32:Slices

so now
#declare Edge_Arr=array[NumVertices*3]
should always be enough
Versus:
#declare Edge_Arr=array[NumVertices*4]

(I was over 972-954 edges)

Post a reply to this message

Attachments:
Download 'segment6.png' (437 KB)

Preview of image 'segment6.png'