Dear Tutors, I made an OO style triangulation based on an old C progam I made about 10 years ago. This makes Delaunay triangualtion over a point cloud in 2D. http://en.wikipedia.org/wiki/Delaunay_triangulation
The sample is working finally. First time I made the triangulation with recursion, but I reached the recursion limit very shortly. So I changed the recursion to a queue. I am interested about your opinions about the OO style I made in it. It hasn't got too much comments, but probably readable. I hope you can test the code easily. I think it has got some interesting programing solutions. Yours sincerely, ______________________________ János Juhász
triangle.py
Description: Binary data
_______________________________________________ Tutor maillist - [email protected] http://mail.python.org/mailman/listinfo/tutor
