Monique.Teillaud at sophia.inria.fr
Tue Jul 18 13:11:08 PDT 2006
Sorry for my late answer...
There are fully dynamic 3D regular triangulations in CGAL (also known as
weighted Delaunay triangulations).
The class CGAL::Regular_triangulation_3 is templated by a "traits class"
parameter, where you can provide your own basic objects and predicates,
so, you should be able to give your own distance through the power_test
predicate. However, the algorithms implicitely assume that the distance
function 'looks like' the weighted Euclidean distance in R^3. I am not
sure this is what you mean by "any distance function"...
Have a look at
manual (online or ps or pdf)
Chapter 3D triangulations
jongho at cs.umn.edu wrote:
> I am trying to find an available software in the Internet that computes
> 3D weighted voronoi diagram --- one that would take any distance
> function as input.
> Thank you for any help.
> Compgeom-discuss mailing list
> Compgeom-discuss at compgeom.poly.edu
More information about the Compgeom-discuss