Nice one, Chris! Source! Source! :)

How is a Voronoi Diagram/Delunay triangulation generated from a BSP tree?

George


On Thu, 25 Dec 2003 19:57:59 -0500, Christopher James Huff 
<cja### [at] earthlinknet> wrote:

> Here's a little patch I've been working on. It is very similar to the
> crackle pattern, but rather than using a 3D grid of points that is
> randomly jittered, it uses a user-specified set of points. It is
> actually very fast, usually faster than the crackle pattern. It stores
> the points in a binary space partition tree, which it can then search
> very quickly, while the crackle pattern must always check a large number
> of points, and sometimes recompute all of them. The options available
> are the same as for the crackle pattern, with the addition of the
> points. You can specify the points alone, or with a blend map index for
> each point, giving you an effect similar to the "solid" feature, but
> with much more control.
>
>
>



-- 
Using M2, Opera's revolutionary e-mail client: http://www.opera.com/m2/

Post a reply to this message