OK, before I start, yeah, this is for a game, but the reason I posted the question in here is because it's a tool I want to use in a game and has nothing to do with the actual game.
So here's the problem: I have lots of 3D points which are actually a series of struct's containing three floats: x,y and z. I also have a file which contains the information on these points.
Suppose I already have all these points in a big array (BIG means in the order of tens of thousands).
each "frame", which is actually about 1/30th of a second (at worst), I have another 3D position with two vectors defining direction and roll , all these actually make the viewer's position.
what I want to do is to know what points are useful for me to process (there are a lot of operations in here), which are actually defined by the 3D position, direction and roll of the viewer, and a clipping distance (the maximud distance I want to show), but I don't want to make lots of calculations for each point in order to see if it's of my interest EACH FRAME!, it would be really slow!
I want to find a way to find all these points without sacrificing game time (I'm willing to sacrifice loading time (like hashing, or something like that), but not game time)
does anybody know a way to do this, or at least enhance the "stupid" method?