Triangulation of what? Scattered points in a plane? 2D manifolds
embedded in a 3D space?
Delaunay triangulations? Constrained triangulations?
--
Robert Kern
rk...@ucsd.edu
"In the fields of hell where the grass grows high
Are the graves of dreams allowed to die."
-- Richard Harter
Googling "delaunay triangulation python" gives this as the first hit:
http://www.python.org/pypi/Delny/0.1.0a2
--
Kristian
kristian.zoerhoff(AT)gmail.com
zoerhoff(AT)freeshell.org
Don;t know if this is what you're looking for, but I have some code here:
http://www.algonet.se/~jgrahn/comp/projects/geese-1.6.tar.gz
find(neighbors)
Find a (x, y) coordinate of a point, based on a sequence of (x, y, d) -
neighbor coordinates and their individual distances from the desired
point.
It's completely unsupported, and probably sucks badly. But it works for my
purposes, and there are unit tests.
/Jorgen
--
// Jorgen Grahn <jgrahn@ Ph'nglui mglw'nafh Cthulhu
\X/ algonet.se> R'lyeh wgah'nagl fhtagn!
Besides Delny, which runs the external program qhull to do its
calculations, I've recently written a package for scipy that uses Steve
Fortune's sweep-line code to calculate Delaunay triangulations. I don't
think there are any public implementations of Delaunay triangulation in
pure Python, though, if that's what you want. You can easily find more
sample code in other languages by googling.
http://svn.scipy.org/svn/scipy/branches/newscipy/Lib/sandbox/delaunay/
> the Internet is down for one day and so wonderful to have so many
> responses. i have checked all the links you guys mentioned. what i
> want is delaunay triangulation and the available ones online are
> written in C, Java and FORTRAN. I want to see some in Python because
> it is hard for me to figure out using python to do Fortune's sweeping
> line algorithm. Is python is not good in doing that kind of
> computation or some other reason?
I know someone once mentioned that they tried writing one of the
Delaunay triangulation algorithms in pure Python and abandoned it for
being unusably slow.