Hi all

I have to display a lot of cubes as visualization of some mathematics computing (in worst case even more than 100 000).
It's real time visualization of computing so I want to display this as fast as possible.
It will be only solid color cubes.
What I have before display is array contains size of cube and location (3d coordinate of center).

I thought for maybe Vertex Buffer of Triangle strips. But if I want use CUDA for generating vertex coordinates (for parallel and fast it up) I will have problem with concatenation of strips (because if I want to insert degenerate triangles to separate cubes I will need to know vertex coordinates for both of cubes and for parallel I need to generate cubes strips separately).

What is your ideas to make it fast?

[font="arial, verdana, tahoma, sans-serif"]Wow, thanks for replying guys, I will look at this technologies

I have another question (maybe silly, but I'm not quite familiar with OpenGL. I rather create algorithms and use OpenGL to visualize results):
What will happen if I will push more data (floats) than graphic card have available ram? Will it make error or start to swap... or what? I think this situation may occur, because my computing use CUDA and it will take large part of graphics card memory.[/font]