So, my idea is this, I can have ID's (integers) representing the various types of nodes we can have..
0 for Transformation
1 for Geometry
2 for Particles
3 etc etc...
I can have a structure that I write to the file, that contains basically, a tree.
First we have the root, in the root structure we can have a vector of children
Lets say the root is a 0, and it has a 1 as a child (in the vector..
The 1 is a geometry node, which also has a particle emitter attached to it, which is a 2 in the geometry's vector of children
So we have something that looks like this:
a 0 with a 1 for a child
a 1 with a 2 for a child
Does this sound like a good way to go about it? I figure with this much information I can create a hard coded tree structure out of the information given.
Step 1: get the root node from the file and all its children, recursively..
create the nodes according to the ID's
step 2: Link them together according to the information in the structure, again the ID's
Does this sound right?