Never give up hope... unless you get an exception

Small update this week: did you know that the date on the 01.11.10 is the same written backwards? I'm only 2 days late...

Back to the real world for a second, this week has been focused on creating a working matching algorithm. The new method of storing information appears to work, though retrieving useful information is difficult as nothing is given names - but as far as can be seen (and drawn out via debugging, and writing down the objects position in memory), it works.

The matching implementation currently looks through the list of edges (that's right, I have edges!), any edges which contain vertices not in a temporary "store" list get paired. When matched, the vertices of said edge get stored in this temporary store so they algorithm knows not to use them again.

There are other methods, such as using flags to determine whether vertices or edges have been matched, or by removing matched edges from the list (in an Array, this is quite difficult). Other methods do exist, however, I am not concerned about efficiency yet, so have no looked into these.

As mentioned before, I am still having some issues with my algorithm but hope to have matching (and so coarsening) finished before the end of the week.

One again, cya!