[Scilab-users] Voronoi tessellation/ Delaunay triangulation in 3d in Scilab?

[Heinz Nabielek]

Dear Scilab friends,

I have 15,000 points in 3d space with known xyz Carthesian coordinates and the basic question is, if their arrangement is random or not.

I had been suggest to do Voronoi tessellation/ Delaunay triangulation. The famous problem of the location of the nearest public phone, but this is only 2d.

Would you be aware of a code fragment that helps in 3d? In either Scilab, C, C++ or FORTRAN?
Greetings
Heinz