Hi Rainer,
Rainer Schuetze wrote:
>
> Ok, the picking methode you propose is a suitable solution. Thanks for
> the advice.
> I intend to handel about 1-10 Million (1E6) points, they are coming from
> a scanner. Putting all points in one geometry object might be very slow
> - the traversing the scene might be very slow (didn't test it by now).
The traversal is not the problem, really, but having to check 1e7 points in a
single geometry, see below.
> I was thinking of using a data structures to optimize the point
> handling, too. Do you have any experience with data structures for
> points. Would you create the data structure (e.g. R-Tree, Quadtree)
> within the scene graph (Nodes)? Would it be better to keep the tree out
> of the scene graph and just link (with pointer, if this is possible) the
> points to the scene graph?
I currently have a student working on adding support for large point sets to
OpenSG, and that will include adding structures like a KD-Tree to a specialized
Geometry node. That is just in the first stages of development though, so right
now there's not really much I can offer you.
Yours
Dirk
-------------------------------------------------------------------------
SF.Net email is sponsored by: The Future of Linux Business White Paper
from Novell. From the desktop to the data center, Linux is going
mainstream. Let it simplify your IT future.
http://altfarm.mediaplex.com/ad/ck/8857-50307-18918-4
_______________________________________________
Opensg-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/opensg-users
