seems to me that the problem is not just the perimeter, but the middle as

well. i have been debugging the program after changing the type definition of

structure 'delaunay' to hild the indeces into the array 'original points' to

see if all the points are represented in the permutations, and sometimes thay

are (when it is ok) and sometimes they are not (when it has holes in) . so

the problem is that the program does generate all permutations but does not

guarantee that all points eventually end up in the stored array of

triangles.i guess that we need not just one loop, but possibly a series of

passes, but how to do it?

p

well. i have been debugging the program after changing the type definition of

structure 'delaunay' to hild the indeces into the array 'original points' to

see if all the points are represented in the permutations, and sometimes thay

are (when it is ok) and sometimes they are not (when it has holes in) . so

the problem is that the program does generate all permutations but does not

guarantee that all points eventually end up in the stored array of

triangles.i guess that we need not just one loop, but possibly a series of

passes, but how to do it?

p

<< Home