Ryutarou OHBUCHI (ohbuchi++at++trl.ibm.co.jp)
Wed, 14 Sep 1994 11:03:36 +0900
Following the path from the node to the root fails since a node may
have multiple parents. (Is this right?)
Another solution I thought of is to traverse the scene graph from
the root (e.g., by pfuTraverse) until the node in question is found,
while keeping track of the transform in a stack of transformation
matrices. This would work fine for a small graph without too severe
a performance problem if the number of queries is small.
Before implementiong the traverse method, I wanted to check if there
is a better method. Performer tend to have many features that I
miss in my cursoly scan of the programmer's manual.
-----
Ryutarou Ohbuchi
IBM Japan, Ltd., SA-S76
1623-14, Shimo-tsuruma, Yamato-shi,
Kanagawa-ken 242, Japan
Phone: 0462-73-4882 Fax: 0462-73-7413
ip: ohbuchi++at++trl.ibm.co.jp
This archive was generated by hypermail 2.0b2 on Mon Aug 10 1998 - 17:50:32 PDT