🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.comp-aided
Article #14

Contour lines

#14
From: Ching-ju Lee
Date: Mon, 06 Apr 1992 18:28
31 lines
1640 bytes
Newsgroups: sci.engr.civil, sci.engr, sci.math
Subject: Contour lines
Summary: References needed
Expires: 
References: 
Sender: Ching-ju Lee
Followup-To: leecj@cs.rpi.edu
Organization: Rensselaer Polytechnic Institute, Troy NY
Keywords: 

Dear Netters:
 
I need recent(1980 or later) references on finding contour
lines(level sets) given the function in a closed functional 
form, or only a set of function values on a grid.  Most of
the algorithms I could find were published in the 1970's,
and they all concerned with issues like pen plotter move-
ment time, or virtual memory required.  But now that we 
have graphic output device other than pen plotters, and
supercomputers with enormous virtual memory and multi-
processors available, I wonder if there are any new approaches
that are designed to take advantage of these features.
I also wonder if there are new ideas in dealing with labeling
different branches of a level set.  The ones I know of seem 
to be too slow.  Accuracy of the contour lines is also very
important to me.  So far I only know methods which use 
linear interpolations.  References on higher order algorithms
are also very helpful.  Please send all follow-ups through
e-mail to leecj@cs.rpi.edu.  I appreciate your help very much.
 
                                Ching-ju Lee
Technical Details
Message-ID: <bw1tvcl@rpi.edu>
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!rpi!leecj

Show Full Headers
Complete Article Headers
Newsgroups: sci.comp-aided
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!rpi!leecj
From: leecj@vega.cs.rpi.edu (Ching-ju Lee)
Subject: Contour lines
Message-ID: <bw1tvcl@rpi.edu>
Nntp-Posting-Host: vega.cs.rpi.edu
Organization: Rensselaer Polytechnic Institute, Troy NY
Date: Mon, 6 Apr 1992 18:28:40 GMT
Lines: 31