[Plib-users] Re: triangles from branches

[Juhana S. <ko...@ni...>]

>From: Paolo Sacconier <ax...@ti...>
>
>I wrote a function that uses the algorithm that you and Wolfram suggest:
[ ... ]
>but I fear that I have to handle also the transformation nodes to get 
>right vertices positions.

Other scenegraphs seems to have graph walkers which does the job.
The walker maintains the current transformations. User only request
the next node in the graph. There could be a couple of ways to
command the walker: (1) when the node is a subtree, we should be able to
skip it, and (2) we should be able to jump off from the current
hierarchy level to one level up (to the next node after the subtree
from which we jumped off).

The other solutions suggested seem to be more suitable to your problem.

Juhana
-- 
  http://music.columbia.edu/mailman/listinfo/linux-graphics-dev
  for developers of open source graphics software