Delaunay is pretty easy, but it's a 2D algorithm so there's always some extra stuff that needs doing when using it in a 3D environment. This is why the PoistSetReconstruction plugin uses Guide geometry, to convert a 3D point cloud into a 2.5D point cloud.
Once Delaunay is finished, it's quite easy to bolt a 2D voronoi cell solver on top. 3D voronoi is much harder to do efficiently. It's not as easy to discard certain points, which means you end up doing a lot of unnecessary solid boolean operations slowing the whole thing down... -- David Rutten Robert McNeel & Associates On Dec 2, 2:29 pm, visose <[EMAIL PROTECTED]> wrote: > Very nice. I also used voronoi a couple years ago as one of the > parameters of urban planning for a school project. The realtime > manipulation of grasshopper would've come really handy. Is the > delaunay algorithm much harder to implement? I'd like to use it to > mesh some unordered point clouds. > > On Dec 2, 8:29 am, Dimitrie <[EMAIL PROTECTED]> wrote: > > > hello oompa, > > as i was also needing some sort of space-partitioning algorithm for an > > urbanism project tomorrow, i tried and managed to pull up a > > grasshopper voronoi node, based on david's algorithm > > you can check it out > > herehttp://dimitrie.wordpress.com/2008/12/01/grasshopper-voronoi-diagram/ > > > On Nov 25, 7:44 pm, oompa_l <[EMAIL PROTECTED]> wrote: > > > > is this possible with grasshopper yet? maybe it always has been...if > > > anyone has any clues on this, I could use it right now... > > > > thanks!
