On 4/4/2011 1:57 PM, Trevor G Quayle wrote:
> One interesting tidbit I had found about the Voronoi digrams when I had looked
> at them a few years ago, is that they can be defined by projecting each point
> vertically to a hyperboloid and defining a plane tangent to the hyperboloid at
> this point.  The voronoi diagram of a set consists of the intersections of these
> planes.

I've read about using /parabolas/ (Fortune's algo) for the creation 
Voronoi cells, but am at a total loss about how to go about it. Your 
description seems clearer than Wikipedia's and Wolfram's. (did you  mean 
parabolas, not hyperboloids?)

There's also the problem of using binary search trees. I haven't even 
tried to develop one yet, but like quad/octrees, their creation appears 
to be a very difficult undertaking. Maybe it's my frame of reference 
(POV) that is giving me trouble, or my total lack of formal math 
training. One of these days I'm going to need to have an understanding 
of such structures (if I ever expect to finish a video game :D).

Sam

Post a reply to this message