[vtkusers] Delaunay and Voronoi

[Nasos Iliopoulos]

Lloyd, check this post:
http://www.vtk.org/pipermail/vtkusers/2000-September/053816.html

Judging from the dealunay implementation in vtk, I don't think there has been much work relative to providing voronoi diagrams since then.


For nearest neighbours I use vtkPointLocator's FindClosestPoint and FindClosestNPoints methods and iterate over all the points in my dataset.
BestNasos






From: lfenelon at bccrc.ca
To: vtkusers at vtk.org
Date: Wed, 24 Jun 2009 09:28:09 -0700
Subject: [vtkusers] Delaunay and Voronoi
















Hello,

 

I've been playing with the class vtkDelaunay2D and few questions
arose:

 

 Is there an easy way to get the circumcenters of the
Delaunay circumcircles using VTK?

 

I have read in the Visualization Toolkit Book that the
Dirichlet tesselation (Voronoi) is the dual of Delaunay,

is there a method/class to get the Voronoi diagram? I have
searched the documentation\mailingList but I haven't found anything...

Is it possible to use filters to get the Voronoi diagram? 

 

Finally, is it possible to get the nearest neighbors of a
point after the Delaunay triangulation? 

 

thanks 

Lloyd

 

 

 


_________________________________________________________________
Bing™  brings you maps, menus, and reviews organized in one place.   Try it now.
http://www.bing.com/search?q=restaurants&form=MLOGEN&publ=WLHMTAG&crea=TEXT_MLOGEN_Core_tagline_local_1x1
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20090624/07dc34df/attachment.htm>