Well looking at the routine, its looks nice; but was actually thinking of using db_functree() to walk recursively up the tree from the leaves inverting and storing the matrix matrix transformations at respective points up the tree and it'll be simpler than actually calling the db_traverse struct; but the correct problem i'm facing is implementing the pull_leaf routine which successfully extracting the matrix transformations from the leaves since it currently does not have one. Could you please help me out here.
Sure, I'll help.. don't start with the leaves!
Start with combination nodes, just pull a matrix up one level. If you can't get combs working, there's no point in working on primitives, and they will be substantially harder.
If you get combs working for one level, commit / make a patch and move on to getting N levels working. After you have N levels working, add an option for just pulling specific matrix components (translation, rotation, or scaling factors). IFF you get all that working, you'll be in a much better place for attacking primitives and we'll already have a usable/useful command even if you do not every step along the way.
Cheers!
Sean
------------------------------------------------------------------------------ Introducing Performance Central, a new site from SourceForge and AppDynamics. Performance Central is your source for news, insights, analysis and resources for efficient Application Performance Management. Visit us today! http://pubads.g.doubleclick.net/gampad/clk?id=48897511&iu=/4140/ostg.clktrk
_______________________________________________ BRL-CAD Developer mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/brlcad-devel
