>> At a glance, your approach seems mostly okay but your approach is very
>> high risk all-or-nothing. I'd like to see you prove that simple basic
>> steps are working perfectly first, like just pulling a matrix up just one
>> level. Or even just pulling a translation component up one level, avoiding
>> linked lists and matrices entirely. They add considerable complexity.
>> Lots that can go wrong and leave you in a debugger for days on end.
>>
>
Looking at my current pull, I am thinking of using a linked list in moving
the matrices up one level, but looks like it'll have some debugging
problems. Could you please give me an alternative in moving the matrix
transformation up one level without using a linked list? like may be using
db_walk_tree with a leaf_func() routine that does that. Also, since there
is no matrix transformation for a combination, How do I create one when
doing the pull. Currently looking at push to see it it worked there.
Thanks for the reply.
Cheers,
Nyah
------------------------------------------------------------------------------
Get 100% visibility into Java/.NET code with AppDynamics Lite!
It's a free troubleshooting tool designed for production.
Get down to code-level detail for bottlenecks, with <2% overhead.
Download for free and get started troubleshooting in minutes.
http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk
_______________________________________________
BRL-CAD Developer mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-devel
