I am implementing DeWall's DT algorithm. I am having a tough time determining just how some of the methods are supposed to go.
My first question: how would I represent a d-simplex in my code? I am using a game engine to generate a mesh with this and it requires a set of vertices and then a set of triangle mappings to those vertices to create the polygons. Is the d-simplex different from a poly/face?
Ive been reading this paper to figure it out: http://vcg.isti.cnr.it/publications/papers/dewall.pdf
So my questions are:
How are Extract(), MakeFirstSimplex(), MakeSimplex() supposed to work? A general (and specific) description of the methods would be fantastic!
Also how to represent said data. I am using Vectors for my points, int[ ]'s for my triangle mappings, and Lists of either for various uses.
Please no code though. I am aiming to do this myself.
