Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uwm.edu!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!liberte
From: liberte@ncsa.uiuc.edu (Daniel LaLiberte)
Newsgroups: comp.graphics.visualization
Subject: Re: Marching Cubes
Message-ID: <LIBERTE.91Apr25163712@yoyodyne.ncsa.uiuc.edu>
Date: 25 Apr 91 22:37:12 GMT
References: <3871@texsun.Central.Sun.COM> <1991Apr24.211855.11705@rice.edu>
	<1991Apr25.005705.16988@jarvis.csri.toronto.edu>
	<2551@lee.SEAS.UCLA.EDU>
Sender: usenet@ux1.cso.uiuc.edu (News)
Followup-To: comp.graphics.visualization
Distribution: na
Organization: University of Illinois, Urbana-Champaign, NCSA
Lines: 10
In-Reply-To: payne@hyperion.loni.ucla.edu's message of 25 Apr 91 19: 00:49 GMT

I implemented a marching cubes algorithm which decomposes each cube
into 5 tetrahedrons.  As Bradley Payne says, there are no ambiguities.
My implementation is public domain (but I dont know whether it is
different enough from the patented marching cubes algorithm to not
infringe).  You can get the code from NCSA DataSlice by anonymous ftp
to ftp.ncsa.uiuc.edu.

Dan LaLiberte
National Center for Supercomputing Applications
liberte@ncsa.uiuc.edu