I have been doing a lot of research of lately and it appears that for my project, I need what amounts to a Minecraft (voxel) (geometry instancing) (octree)(point cloud) engine that will allow me to visualize millions of data points representing polygons in 3D space and be able to zoom through them inspecting any/all of the polygons and query the datapoints by clicking on them. The polygons will all be the same shape, but their 3D rotation and associated face colors will depend on the datapoint. I have written this in straight Processing previously, but kept running up against memory limitations after only a few thousand points, so I am restarting from scratch. Any and all suggestions of thoughts of directions or EXAMPLES would be greatly appreciated. A last point would be that I need to load these Datasets as rapidly as possible, as each set is a timeframe for the data collection and I would like to see how the data change visually through the time periods.
My newest point format will be similar to: Point(x,y,z) {rotationX, rotationY, rotationZ: Int (0..360) var1, var2, var3: Int}
By having these few variables for each point and correlating hash tales, I should be able to determine all needed data for my project. Attached is an image of the last straight processing result I created, to give an idea of the data visualization I need, except this does not show any of the cubes rotated.
