Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!cbatt!cbosgd!ihnp4!houxm!homxb!mrw
From: mrw@homxb.UUCP (M.WHITNEY)
Newsgroups: net.graphics,net.wanted
Subject: Re: Contour Algorithm wanted
Message-ID: <1854@homxb.UUCP>
Date: Sun, 10-Aug-86 03:10:14 EDT
Article-I.D.: homxb.1854
Posted: Sun Aug 10 03:10:14 1986
Date-Received: Mon, 11-Aug-86 02:47:27 EDT
References: <292@briar.UUCP>, <150@mipos3.UUCP>
Organization: AT&T Bell Labs, Holmdel NJ
Lines: 18
Keywords: contour
Xref: watmath net.graphics:1828 net.wanted:9386

To whom it may concern:
                      An outstanding source of contour algorithms
and TONS of other goodies is the _Collected_Algorithms_of_the_ACM_,
which can be found in most college libraries.  I used one called 
GCONTR which did an outstanding job on my thesis graphs.  It is 
written in vanilla FORTRAN-IV, and has many options regarding the
machine dependent stuff.  You will need to adapt your particular
graphics system calls to the ones they use in the program, but it is
really not too difficult.  I also adapted it to run under Microsoft
FORTRAN with a couple of short assembly code programs.  There are other
routines in the Algorithms besides GCONTR that do contour plotting, in-
cluding ones that can be used to generate contour maps with irregularly
spaced data points.

           Ken Becker   hotlv!kab

The opionions expressed above are mine only, and not those of my employer.