Does anyone know of sample code showing how the marching cubes
algorithm may be implimented using Python?
Ref:- http://local.wasp.uwa.edu.au/~pbourke/geometry/polygonise/
I can set up the cubes and test to see if their vertices are inside
the isosurface.
I can produce a resulting "metaball" but
On Mon, 03 Sep 2007 23:24:42 -0500, Robert Kern
<[EMAIL PROTECTED]> wrote:
>transpose()
ahh yes I can see where that would work. Just tried it in the above
and I do get a last line of ones.
OK onward and upward :)
Many thanks Robert.
--
http://mail.python.org/mailman/listinfo/python-list
7307 4.2138840.3408408
0.72615216 0.66384632 4.213884 ]
[ 0.2735711.26381257 -0.66763452 0.909945 -0.585931
1.13709619 0.39979 0.909945 ]
[ 0.2 0.429486 -0.2102861. 0.2
0.4294860.1897141.]]
Am I going in the right direction?
What do I do
nd=
The background color. The default is system specific."
The manual may be published in book form so may not be free. Does
anyone have contact information for Mr Lundh in order that I might
perhaps send him a draft copy for his comment?
Many thanks,
PhilC
http://www.philc.net
--
http