Yes, I'm still working on this... ;)
I have it working, but it's a bit slow. My first problem was my crude
sorting algorithm. I can get around that.
Now I think my problem is the slowness of moving BranchGroup nodes
around in the OrderedGroup. I thought I had heard that detaching a
BranchGroup and re-attaching was very expensive. I tried searching the
archives but the listserv search engine is a bit slow for me right now.
Since I can't just reorder the nodes in an OrderedGroup ( I really think
this should be included in the API ), then I am *forced* into detach and
reattaching BranchGroups, which means it is always going to be slow for
me.
Does anybody know of a way to get around this problem??
I expect that Group has a "protected Node[] children" member. Is there
really any behind-the-scenes reason why the members of this array can't
be rearranged by just changing their order in the array using some new
function?
-Lee
J. Lee Dixon
SAIC - Celebration, FL
321-939-7917
[EMAIL PROTECTED] AOL: LeeOrlando
===========================================================================
To unsubscribe, send email to [EMAIL PROTECTED] and include in the body
of the message "signoff JAVA3D-INTEREST". For general help, send email to
[EMAIL PROTECTED] and include in the body of the message "help".
