Celestia octree
Posted: 18.01.2003, 03:08
Hi
I'm writing some software which involves large numbers of stars (at least a million) - much in the way that celestia does.
I'm now at the point where I need to create an efficient octree to store all this star data, and I was hoping you're knowledge of the subject could save me some time here.
I have two basic questions:
1 - What rules do you apply when storing a star in a given node? I know it's a combination of position and abs magnitude - but what actual numbers do you use?
2 - How many levels of recursion are required from the root node to the deepest nodes? And is this depth pre-determined, or do you just keep recursing until a certain criteria is met?
Regards
Mark Shaxted
I'm writing some software which involves large numbers of stars (at least a million) - much in the way that celestia does.
I'm now at the point where I need to create an efficient octree to store all this star data, and I was hoping you're knowledge of the subject could save me some time here.
I have two basic questions:
1 - What rules do you apply when storing a star in a given node? I know it's a combination of position and abs magnitude - but what actual numbers do you use?
2 - How many levels of recursion are required from the root node to the deepest nodes? And is this depth pre-determined, or do you just keep recursing until a certain criteria is met?
Regards
Mark Shaxted