|
![](/i/fill.gif) |
On 10 Mar 2000 10:51:36 -0500, Nieminen Juha wrote:
>Ron Parker <ron### [at] povray org> wrote:
>: I think MegaPOV still has the "type 2" bicubic patch, which evaluates the
>: bicubic directly.
>
> How is this done? How fast is it? Can it be done even nearly as fast as
>with triangles?
According to the comments, it uses "NSK (Nishita, Sederberg,Kakimoto)"
Whether it's faster or slower is something I've never investigated. The
code (bezier2.c in the superpatch, presumably also in megaPOV) is also
riddled with FIXME statements (and the accompanying comments are often
in Czech, as well, making it difficult to determine what needs fixed)
so I'm not sure how well it all works in the real world.
--
These are my opinions. I do NOT speak for the POV-Team.
The superpatch: http://www2.fwi.com/~parkerr/superpatch/
My other stuff: http://www2.fwi.com/~parkerr/traces.html
Post a reply to this message
|
![](/i/fill.gif) |