Hi Andi,
On 09/21/2011 02:39 AM, Andreas Halm wrote:
> Hello All,
>
> I have seen that Action::apply(iterator,iterator) is virtual, but not
> overwritten in IntersectAction. However, without the overwrite using that
> function does not seem to make much sense – or maybe I’m completely wrong
> here?
> If you have a vector/list/… of Nodes, you have to apply the world matrix of
> each
> of the nodes before descending recursively. Otherwise the result would be
> wrong.
> However, you cannot do that outside of the function because it is not
> guarantueed that the nodes have the same parent.
The idea is that all nodes passed into that method are in the same coordinate
system, i.e. they all come from the same parent node, and the ray is in the
same
coordinate system, too.
So if you just have a list of Nodes from anywhere in the tree there is no
direct
way to intersect only against those. I would recommend using a traversal mask
to
the Nodes you want to intersect and just intersect against the root. The only
problem here is that you need to mark all Nodes between yours and the root, or
to just mark all Group nodes and just not the Geometry nodes you want to skip.
Hope it helps
Dirk
------------------------------------------------------------------------------
All the data continuously generated in your IT infrastructure contains a
definitive record of customers, application performance, security
threats, fraudulent activity and more. Splunk takes this data and makes
sense of it. Business sense. IT sense. Common sense.
http://p.sf.net/sfu/splunk-d2dcopy1
_______________________________________________
Opensg-users mailing list
Opensg-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/opensg-users
