Xref: utzoo comp.graphics:16628 comp.graphics.visualization:361
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!ub!okeefe
From: okeefe@cs.Buffalo.EDU (Paul O'Keefe)
Newsgroups: comp.graphics,comp.graphics.visualization
Subject: Re: how to view f(x,y,z) = constant surfaces ?
Message-ID: <65581@eerie.acsu.Buffalo.EDU>
Date: 15 Mar 91 20:35:09 GMT
References: <1991Mar14.234739.15281@athena.mit.edu>
Sender: news@acsu.Buffalo.EDU
Followup-To: comp.graphics
Organization: State University of New York at Buffalo/Comp Sci
Lines: 39
Nntp-Posting-Host: zanian.cs.buffalo.edu
Originator: okeefe@zanian.cs.buffalo.edu


In article <1991Mar14.234739.15281@athena.mit.edu>, chasman@athena.mit.edu (David Chasman) writes:
|> What I am looking
|> for is some code to take the function zz = f(x,y,z) and render the 3-D surface
|> which corresponds to this.  
|> 
|> Ideally, I'd like C-code for a silicon graphics machine.
|>

In addition to those already cited:

One)	apE from OSU has a module Onion which implements 
	Lorenson and Cline's Marching Cubes alogorithm.
	It comes with SGI binaries and source. Since apE
	is a complete environment, it can render the results.
	However, apE also comes with a $75.00 price and some
	license restrictions which differ for academic and
	non-academic users. Info on apE is available via
	anonymous ftp at apE.osgp.osc.edu (128.146.18.18).

Two) 	There is a C code implementation of Marching Cubes
	by Steve Lamont formerly of the NC SuperComputer Center.
	It's available via anonymous ftp at szechuan.ncsc.org.

Three)  Although Marc Levoy is most famous for his volume rendering
	algorithm, he also has an iso-value surface rendering algorithm.

@Article{LC:,
  author =      "Levoy, Marc",
  title =       "Display of Surfaces from Volume Data",
  journal =     IEEE Computer Graphics and Applications,
  year =        1988,
  month =       "May",
  volume =      8,
  number =      3,
  pages =       "29-37"
}

-Paul O'Keefe