Actually, that is very feasible. Now that I've dug further into it from previous conversations also, it would lend itself to it, and it would be a major memory saver, to boot.
So many good suggestions. Thank you!
In reply to Re^2: An efficient, scalable matrix transformation algorithm
by Luftkissenboot
in thread An efficient, scalable matrix transformation algorithm
by Luftkissenboot
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |