|
![](/i/fill.gif) |
Rune <run### [at] iname com> wrote:
:> If a PCM is optimized, some vertices and normals can be
:> shared. This causes a problem
: That can easily be solved, it just requires more memory in the parsing
: stage...
It's, however, a rather rare case. I suppose that most people don't
optimize the PCM, and even if they do, it seldom succeeds (unless they
use a very high error tolerance).
I'm not sure if it's worth the efforts to take that possibility into
account...
--
char*i="b[7FK@`3NB6>B:b3O6>:B:b3O6><`3:;8:6f733:>::b?7B>:>^B>C73;S1";
main(_,c,m){for(m=32;c=*i++-49;c&m?puts(""):m)for(_=(
c/4)&7;putchar(m),_--?m:(_=(1<<(c&3))-1,(m^=3)&3););} /*- Warp -*/
Post a reply to this message
|
![](/i/fill.gif) |