Sorry I made a mistake. On Thu, Jun 23, 2011 at 11:07 AM, Michael Mc Donnell <mich...@mcdonnell.dk> wrote: > Yes that's the basics of it. It does some other funny things too. For > example it re-orders the indices, so if you have > > 0--1 6 3 > | / / | | \ > | / / | | \ > 2 8--7 5--4 > > That corresponds to: > > index buffer = [ 0,1, 2, 6, 7,8, 3, 4,5] > adjacency = [-1,1,-1, 2,-1,0, -1,-1,1] > point rep = [ 0,1, 2, 1, 4,7, 1, 7,2]
Index 5 is not replaced by 7 because the lowest index is always used. So it should have been the other way around: point rep = [ 0,1, 2, 1, 4,5, 1, 5,2] > If the indices had not been re-ordered then the point representation > would have been > [0,1,2, 1,7,2, 1,4,7]. And similarly [0,1,2, 1,5,2, 1,4,5]. I'll put this example into the test.
