In article <opr0roznhnhr234r@news.povray.org>,
 George Pantazopoulos <george@gamma*KILLSPAM*burst.net> wrote:

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

The same way the crackle pattern does it. The distances of the three 
nearest points are found, and the pattern value is computed from that. 
The voronoi pattern just stores user-defined points in a quickly 
searchable tree structure, rather than generating pseudo-random points 
(stored in a cache array) on the fly.

Post a reply to this message