The fastest data structure in Java (processing for 4D visualization)

Question

I have an application for which I need to use a visualization environment. I'm currently leaning towards processing for use in a Java desktop application.

Problem: I have ~ 500k + state vectors that I need to visualize. 4D points - XYZ and time (GPS-like)

I need to be able to quickly and easily select time fragments, while also being able to reproduce them in time. I have the ability to change the input using either flat files or db.

So the question is, which data structure will best suit my needs? Am I reading files in Arraylists? Hashmap? Or in a memory database? Or something else?

Performance is a must for 3D visualization. The time period is more than 8 hours. Therefore, not all of them will be displayed immediately.

Has anyone tried to use a creative coding system for this type of use? Any suggestions?

Thank!

Answer 1

Processing with OpenGL is an option, but if you run into performance issues, I would recommend looking at openframeworks or libcinder .

This is C ++, not java, but openframework, for example, has very similar syntax for processing.

Compare Matt Swoboda recode in other implementations.

, OpenGL, , , openframewoks libcinder.

Answer 2

jMonkey , - , .

, . , , , , , ... (.. , ).

Answer 3

2d . , quicksort mergesort, .

Answer 4

float [][]vectors=new float[4][500000];

Just make sure you sort them from start to finish. Keep it simple and check it out?