HDTenEightyP/NetNews huggingface dataset:
From: eugene@wilbur.nas.nasa.gov (Eugene N. Miya)
Subject: We may yank the graphics references mail server from decwrl
Organization: NAS, NASA Ames Research Center, Moffett Field, CA
Date: Thu, 9 Apr 92 16:47:15 GMT

As you may recall, the Bay Area ACM/SIGGRAPH set up a widely used graphics
references server on the host decwrl.dec.com.  DEC has been kind enough
to provide the disk space and cycles.

Unfortunately, support for continuing maintenance of the server
has not been forthcoming from SIGGRAPH.  
The server continues to fall behind the times.  Many people are willing
to use the server, but unfortunately few are willing and able to
contribute.  This is a major effort, and my efforts have to come to a close.
I would rather NOT have the daemon issuing dated references.  The matter
will fall into the hands of ACM/SIGGRAPH during the next month, and failing
that after one more month, I will tell DEC to kill the server daemon.

This note is being issued to forewarn you of the eminent demise of the server.

1) You can apply pressure on BA ACM/SIGGRAPH (Bruce McDiffit)
and ACM/SIGGRAPH (Jim Thomas) [I do not have time to continue working
on this.].  Do not bug DEC.  Do not bother ACM.

2) This will be your last chance to anonymous FTP the text from
gatekeeper.dec.com (and if you do this, you should do this as a SITE,
not as individuals, if you did the latter, can you imagine hundreds of 
worried readers on a campus bring over copies of the same multi-MB files?
Coordinate.).  The files can easily be moved to the SIGGRAPH machine:
siggraph.org, but that is not the issue.  The issue is the antiquation
of the files.  I'd rather kill it now than issue obsolete data years
from now.  As a warning, this is a non-trivial effort.  Those believing
you can do this once and be done with it, need not apply.  Long-term
commitment required.

The material in question is published copyright information of the
Association of Computing Machinery and is available for non-profit use.
The server daemon notes the terms and conditions.

This issue has nothing to do the old FAQ, the problem existed before the FAQ.
Questions?  Email me as I don't have time to read this group anymore.

--eugene miya, NASA Ames Research Center, eugene@orville.nas.nasa.gov
  Resident Cynic, Rock of Ages Home for Retired Hackers
  {uunet,mailrus,other gateways}!ames!eugene
This is the Usenet: do you expect anything other than gross generalizations?
Ref: Mathematics and Plausible Reasoning, vol. 1, G. Polya
Newsgroups: comp.graphics
From: molly@muse.cs.mu.OZ.AU (Mark Ollila)
Subject: Photogrammetry Software needed.
Keywords: Photogrammetry SOFTWARE
Organization: Computer Science, University of Melbourne, Australia
Date: Mon, 6 Apr 1992 09:15:41 GMT

Hi,
	I am doing some work in Non-topographical photogrammetry
and discovered that there are software packages out there in the
area. I tried searching by archie for some of the well known ones such
as CRISP, STAR, CRABS-ESP etc. but could not find them. 

Does anyone know if they are availble on ftp sites, or if there
are any photogrammetric software ( of any sort ) anywhere.

Thanks in advance.
	Mark.
	molly@vis.citri.edu.au
From: Doug Dulmage <ddulmage@igc.org>
Newsgroups: comp.graphics
Date: 09 Apr 92 17:06 PDT
Subject: Re: S.P.I.E.  ??
Nf-ID: #R:1992Apr9.145951.7011@arbi.inform:-46333793:cdp:1347100012:000:185
Nf-From: cdp.UUCP!ddulmage    Apr  9 17:06:00 1992


SPIE=Society of Photograhic, Instrumentation, Engineers, or something to
that effect. They publish journals, have conferences, etc. Mainly to do
with Electro-optics, lasers, imaging..
From: govindg@ucunix.san.uc.edu (Girish Govind)
Newsgroups: comp.graphics
Subject: Gnuplot mailing list, gnuplot problem.....
Date: 9 Apr 92 13:53:37 GMT
Organization: University of Cincinnati

Hello!
I have a strange problem with gnuplot 3.0. I have one plot with several 
traces (which are gaussian shaped functions arranged along the axis).
With anything higher than 17 traces on one plot gnuplot seems to quit 
and it complains about wrong syntax of the plot command (basically it
seems to only parse a certain number of characters after which it bombs).
I know that 17 is a pretty large number but I need to be able to put upto
50 traces on the same plot (no legend or anything just a normal line for all
of them).

Can anyone suggest how I could do this? Is there any buffer I need to enlarge
so that it would parse more characters for each command?

I have not been able to subscribe to the gnuplot mailing list as both
the ucbvax.berkeley.edu as well as the sun.com machines are sending back my
subscription request (that info-gnuplot-request is an unknown user). Can
someone tell me what to do?

Thank you very much.

-- Girish Govind
   (govindg@ucunix.san.uc.edu)
From: walver@kielo.uta.fi (Ville V. Walveranta)
Newsgroups: comp.graphics
Subject: Re: it
Date: 9 Apr 92 06:52:21 GMT
Reply-To: walver@uta.fi (Ville Walveranta)
Organization: University of Tampere, Finland
In-reply-to: ozman@wam.umd.edu's message of 6 Apr 92 19:28:23 GMT


ozman@wam.umd.edu (Brian Oswald) writes...
> I am looking for a list of FTP sites for graphics for a Macintosh.  
> Preferably nice disgusting tasteless nude womyn.  Much appreciated...

	You haven't been following your time, have you? The 'nude womyn'
	pictures vanished from the internet and from the great number
	of private BBSes over a year ago. In the network this was
	done because of the excessively grown network (FTP) traffic. Global
	removal of such pictures decreased the network load by 20% or more.

	-- Willy
--

 *****************************************************************************
   ***      Ville V. Walveranta       Tel/Fax....: + 358 17 170 521      ***
     ***    P.O. Box 49               Email......:   walver@uta.fi     ***
     ***    SF-13211  HAMEENLINNA                                      ***
   ***      FINLAND                   "I have met the mailer daemon!"    ***
 *****************************************************************************
From: eric@pencom.com
Newsgroups: comp.graphics
Subject: Re: colour dithering
Date: 13 Apr 92 13:31:53 GMT
Organization: Pencom Software

In article <1992Apr10.043615.15106@ccu1.aukuni.ac.nz> mmt@ccu1.aukuni.ac.nz  
(Mark Thomson) writes:
> I'm looking for an algorithm to dither an RGB colour image. I know how to 
> dither monochrome images, but am unable to find any info on colour dithering.
> Any help would be appreciated.

color dithering is a generalization of color->grayscale dithering.
Treat each channel of your r,g,b triplet as grayscale and work from
there.

i.e.  for a floyd steinberg error-diffusion algo. Instead of
keeping an array of single error values, I kept an array
of error-value triplets.  Whenever I wanted to construct
the desired rgb of a pixel, I added the existing rgb error
to the rgb I wanted to display, found out what the display
was capable of displaying, and diffused the resulting error-triplet
to surrounding pixels.
From: ph_su@csd.brispoly.ac.uk (J.B. the Frog!)
Newsgroups: comp.graphics
Subject: Pattern recognition vs Vision
Date: 14 Apr 92 10:26:20 GMT
Organization: Bristol Polytechnic, England

Bonjour,

There's a question which puzzle me a lot.
Can anybody tell me the difference between Pattern recognition,
Vision, Image understanding and a definition of each
of the above.
It seems for me that are very close to one another, and 
that sometimes mean the same damn thing!

Merci beaucoup,

Jean-Baptiste
ph_su@csd.brispoly.ac.uk
-- 
JB (Jean-Baptiste)
<================>
-----------------------------------------------------------
" A *kiss* is that little rosy dot over the "i" of Loving "
Newsgroups: comp.graphics
From: jwstuart@ecst.csuchico.edu (Jesse William Leo Stuart)
Subject: GIF Editor
Organization: California State University, Chico
Date: Mon, 06 Apr 1992 07:09:35 GMT

	I've been making some great fractal images with FRACTINT 17.2 and
wanted to combine some images.  Is there a freeware, shareware, anything-I-
can-use-without-paying-anything-ware (aicup-ware) program available for 
either X-windows or msdos that I can use.  My images were made on a Tseng
3000 chip with 256 colors.

Jess Stuart
CSUC Chico CA
Newsgroups: comp.graphics
Subject: VMS/UIS format specification wanted
From: marcello@deis16cineca.it (Marcello Dalpasso)
Date: Mon, 13 Apr 92 06:53:35 GMT
Organization: *********************************************************
Originator: marcello@deis16


Hi

I'm looking for the format specifications of the graphic language UIS
under VMS. Can anyone help me?

Are there any converter between such a format and other, well-known, Unix
formats, such as ppm, gif, jpeg, tiff etc. ?

Thank in advance
-- 
	Marcello Dalpasso (e-mail: marcello@deis16.cineca.it)
	D.E.I.S. - Department of Electronics and Computer Science	
	Viale Risorgimento 2, I - 40136 Bologna, Italy			
	Phone: +39-51-644-3015 (fax: 3073)
-- 
	Marcello Dalpasso (e-mail: marcello@deis16.cineca.it)
	D.E.I.S. - Department of Electronics and Computer Science	
	Viale Risorgimento 2, I - 40136 Bologna, Italy			
	Phone: +39-51-644-3015 (fax: 3073)
From: worley@updike.sri.com (Steve Worley)
Newsgroups: comp.graphics
Subject: Re: Distributing points on a sphere
Date: 8 Apr 92 23:05:41 GMT

canderso@cvbnet.prime.com (Chris Anderson 4-1660 x??) writes:


>I have a need to distribute a set of n points (where n is generally >> 10)
>evenly over the surface of a unit sphere.  My present method generates 
>lattitude circles and divides the points among them in a simple-minded
>way, such that I nearly always end up with uneven spacing and/or an
>"incomplete" sphere.

>My desire is to have a set of coordinates for points on the sphere
>surface with equidistant spacing and full "coverage", regardless of
>the value of n.  Is this a problem that someone else has already
>solved in an elegant way?


This question is *ALMOST* answered in the FAQ list: however, the
answer given there will only tessilate a sphere with a certain subset
of points, something like 6,12,24,48, etc. No flames that "You should
look at the FAQ!", though, since you want a solution for arbitrary n.

I gave a solution for this problem about six months ago here on
comp.graphics, outlining my own algorithm. Basically, you want to
spread the points out so that they are a maximal distance to each
other in a least squares sense. This is analagous to placing point
charges on a sphere: their mutual repellant forces will push them into
a state of minimal energy: this is (in the least squares sense) the
"best" solution.

The algorithm I outlined can be found in the comp.graphics archives from
about six months ago. Grepping  for "worley" should find it fast; I don't
post that frequently unless I have something to contribute.

(No, I don't have a copy of the post or any code any longer: You'll
have to find my old post. Implementation in C or anything else takes
about 15 minutes.)

Good luck!

Steve Worley

worley@updike.sri.com



Newsgroups: comp.graphics
From: supervisor@eleceng.uct.ac.za (Engineering File Server Manager)
Subject: Re: finding shadow of a convex polyhedra. how to ?
Organization: Department of Electrical Engineering, University of Cape Town
Distribution: comp.graphics
Date: Thu, 09 Apr 92 15:24:30 GMT

In article <1992Mar31.063041.5026@yuma.acns.colostate.edu> flatau@lamar.ColoState.EDU (Piotr Flatau) writes:

>.
>.

>This probably was asked before.

>I would like to determine the polygon vertices forming shadow
>outline of a projection of a convex polyhedron.
>In more detail: say, polyhedron is determined by the set of vertices
>(v1, v2, ..., vn). Projecting them on a plane gives
>new vertices  q_i, i=1,...,n
>I would like to know how to eliminate some of q_i's to form
>a  subset which determines the polygon vertices of a
>shadow.

>For example take a tetrahedron sitting on a table (projection
>plane). Its projection looks like


>                     . q1


>                     .q2


>          . q3                 . q4
>        
>How do I eliminate q2 ?

>Once this is done. How do I enumerate q1,q3,q4 so they
>form "cyclic" polygon which I can use in point-in-polygon
>tests (this is trivial in this case).

>Peter
From: jp@Apple.COM (John Peterson)
Newsgroups: comp.graphics
Subject: Photo CD Information
Date: 17 Apr 92 18:55:54 GMT
Organization: Apple Computer Inc., Cupertino, CA

> About a year ago I posted asking if anyone had details on Kodak's Photo
> CD system. I got about two `me too' replies, and that was it! Well,
> it's supposed to be launched this Summer, so how about it? Anyone know
> what its capabilities are, how much of the colour and spatial
> resolution you lose from a 35mm neg, what the players can do (zoom/pan
> etc etc)?

Resolution is up to 3Kx2K, quality loss is minimal.  Players can do Zoom & Pan.

For more info, contact:

	Kodak Information Center
	Dept. E, 343 State Street
	Rochester, NY 14650-0811
	Phone: 1-800-242-2424, Ext. 51

A good thing to ask for is "Photo CD Products, A Planning Guide for Developers"
This answers most technical questions about the technology.

Disclaimer:  I have no affilation with Kodak.

Cheers,
jp
From: mahoney@primerd.prime.com (Michael Mahoney)
Newsgroups: comp.graphics
Subject: TIFF to PCX conversion - PLEASE HELP!
Date: 14 Apr 92 20:48:14 GMT
Organization: Prime Computer R&D

I need to locate a conversion utlity (preferably source code) which will
convert Group 3 compressed TIFF files into PCX format. This would be for
DOS/Windows. Could anybody steer me in the right direction? I really do 
need this information as soon as possible. THANKS in advance!!!

                                                Mike
                                                mahoney@ssgp62.Prime.COM


-- 

----------------------------------------------------------------------------
Mike Mahoney                Constellation Software       (508)620-2800 X2965 
mahoney@ssgp62.Prime.COM    500 Old Connecticut Path     (508)620-1651
Newsgroups: comp.graphics
From: speer@anchor.cs.colorado.edu (Rick Speer)
Subject: Anyone have this address?
Followup-To: speer@cs.colorado.edu
Organization: University of Colorado, Boulder
Date: Fri, 17 Apr 1992 19:39:24 GMT

Anyone have an address, e-mail or otherwise, for Mark Watt,
Digital Pictures, London?


Rick S.
speer@cs.colorado.edu
Newsgroups: comp.graphics
From: mskuhn@immd4.informatik.uni-erlangen.de (Markus Kuhn)
Subject: Re: Morphing
Organization: CSD., University of Erlangen, Germany
Date: Thu, 16 Apr 1992 17:15:17 GMT

"Suzanne Menzel" <menzel@iuvax.cs.indiana.edu> writes:

>Can anyone provide me with a reference for the "morphing" technique
>use in Michael Jackson's video "Black or White" and in "Terminator 2"?

What you need is the book

   George Wolberg, Digital Image Warping, IEEE Computer Soc. Pr., 1990,
   ISBN 0-8186-8944-7/0-8186-5944-0.

Have fun ...

Markus

---
Markus Kuhn, Computer Science student -=-=- University of Erlangen, Germany
Internet: mskuhn@immd4.informatik.uni-erlangen.de  |  X.500 entry available
Don't worry over what other people are thinking about you. ----------------
---------- They're too busy worrying over what you are thinking about them.
From: jnimerof@grad1.cis.upenn.edu (Jeff Nimeroff)
Newsgroups: comp.graphics
Subject: Re: Distributing points on a sphere
Date: 9 Apr 92 15:26:18 GMT
Reply-To: jnimerof@grad1.cis.upenn.edu (Jeff Nimeroff)

In article <2995@cvbnetPrime.COM>, canderso@cvbnet.prime.com (Chris
Anderson 4-1660 x??) writes:
|>
|>I have a need to distribute a set of n points (where n is generally >> 10)
|>evenly over the surface of a unit sphere.  My present method generates 
|>lattitude circles and divides the points among them in a simple-minded
|>way, such that I nearly always end up with uneven spacing and/or an
|>"incomplete" sphere.
|>
|>My desire is to have a set of coordinates for points on the sphere
|>surface with equidistant spacing and full "coverage", regardless of
|>the value of n.  Is this a problem that someone else has already
|>solved in an elegant way?
|>
|>Thanks for any help.
|>
|>Regards,
|>
|>---Chris Anderson.
                 
It has been my experience that the method proposed by Don Mitchell in his
1991 SIGGRAPH paper works well.  The longitude/latitude stratification of the
sphere is anisotropic so generating random points to be placed in a mesh of
patches on the surface does not generate "random" points on the sphere.
An O(n^2) algorithm is as follows....
	Randomly pick a point on the sphere to start
	For all i running from 2 to n
		To place the ith random point, generate m candidate points		
			(m large)
		Find the minimum distance from each of the m candidates to the
			previously placed points on the sphere.
		Add the candidate that has the highest minimum distance value.

This algorithm approximates a Poisson-sphere distribution....

Hope it helps

-Jeff Nimeroff
Computer Graphics Research Lab
University of Pennsylvania
From: wes@uf.msc.edu (Wes Barris)
Newsgroups: comp.graphics
Subject: Re: URT RLE to TGA
Date: 6 Apr 92 19:58:26 GMT
Article-I.D.: uc.1992Apr6.195826.13512
Reply-To: wes@msc.edu
Organization: AHPCRC

In article <92096.211256MXD120@psuvm.psu.edu>, Beaker <MXD120@psuvm.psu.edu> writes:
|> I am having problems converting a URT RLE file into TGA format under UNIX.
|> This is how I'm doing it:
|> 
|> rletoraw < file.rle | raw2fbm | fbm2tga > file.tga
|> 
|> The pipe seems to choke on fbm2tga.  It give an error saying 'Unknown magic
|> character 201.'  The URT and PBM utilities were already on the system
|> I am using, but I had to compile to Fuzzy Pixmap utilities.  I noticed
|> that the compiler was giving a _lot_ of warnings when compiling, but
|> I just ignored them.  I think the version of FBM that I got was 0.96.
|> Does anybody know what is going wrong or know of an easier way to
|> convert RLE to TGA?  Thanks.
|> 

The Utah Raster Toolkit does include a rletotarga filter.  All you should
have to do is

rletotarga file.rle >file.tga

If this filter does not exist on your system, it may not have been built
when the toolkit was installed.  See whoever installed the URT.
-- 
      o o o o o o o . . .   ________________________________ _____=======_T___
    o      _____           ||Wes Barris                    | | wes@msc.edu   |
  .][__n_n_|DD[  ====|____  |Minnesota Supercomputer Center| |(612) 626-8090 |
 >(________|__|_[___/_____]_|University of Minnesota_______|_|_FAX: 626-1596_|_
 _/oo OOOOOO o`  ooo   ooo  'o^o^o                    o^o^o` 'o^o         o^o`
-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
Make yourself into a sheep, and you'll meet a wolf nearby. -- Russian proverb
From: ps@elan.princeton.edu (Peter Schroeder)
Newsgroups: comp.graphics
Subject: Re: Distributing Points on a Sphere
Date: 15 Apr 92 19:19:28 GMT
	<sgp.702788869@phyast.nhn.uoknor.edu> <1992Apr9.160333.29567@kpc.com>
	<PS.92Apr10081042@elan.princeton.edu>
	<1992Apr13.212843.19125@m.cs.uiuc.edu>
Organization: Computer Science Department, Princeton University

In article <1992Apr13.212843.19125@m.cs.uiuc.edu> pmoran@m.cs.uiuc.edu (Pat Moran) writes:

   The solution to this would be useful for specifying a sequence of gradient
   directions for a magnetic resonance system.  The minimizing the maximum
   chord length constraint is important because we want to minimize the
   amount we switch the magnetic field after each sample.

Check out your favorite computational geometry book for a solution.

Peter
From: arbogast@statsci.com (Emmanuel Arbogast)
Date: Mon, 13 Apr 1992 20:02:55 GMT
Subject: Points in a rectangle pb
Organization: Statistical Sciences, Inc
Newsgroups: comp.graphics
Keywords: computational geometry

I am looking for references/algorithms/C code for the following classical
problem:
I am brushing points on a X window, and would like to hignlight the points as fast as possible, or in other terms:

Given n points laying in a large rectangle, and a small rectangle; Which points actually are inside the small rectangle? My points are fixed, but the small
rectangle (brush) is moving pretty fast. Since I could have a large number of
points, I need a somewhat "optimal" algorithm to perform this detection.
Any hints/references/solutions are welcome, and I will summarize to the net
if there is enough interest.

PS: I was unable to find the FAQ on our machines, so I apologize if the answer is there. Could you then send me a copy of the FAQ by mail SVP?

Emmanuel
arbogast@statsci.com
From: uselton@wk207.nas.nasa.gov (Samuel P. Uselton)
Newsgroups: comp.graphics
Subject: Re: 3D -> 2D translation
Summary: You really need a book, because a decent answer is too long for typing
Date: 7 Apr 92 16:57:38 GMT
Organization: NAS, NASA Ames Research Center, Moffett Field, CA


>OK, thanks to the ONE person who gave me a reference to a book on how to
		Me, I think.
>do what I want to do.  Unfortunately it's nowhere to be found and the only
>thing similar costs $70.  Surely SOMEONE on the 'net can out of the
>goodness of their heart HELP me.
>
	What kind of help are you expecting?  I said any decent graphics
	text would have the info, and named one.  I also included the 
	terminology (viewing transformation) that would help you zero in 
	on the right spot in whatever book you can find.

>I want to translate world (x,y,z) coordinates to screen (X,Y) coordinates
>based on a viewpoint of (xe,ye,ze), looking in direction (theta, phi).

	This transformation, in slightly different form, is the subject
	of anywhere from a section to a whole chapter in *any* decent
	text, BECAUSE IT TAKES THAT LONG TO EXPLAIN IT.  Do you really
	expect someone to type several pages out of a book to answer your
	net question?  How many pages would YOU type?  When I was teaching
	(which I did for ten years) I had a six pages hand out to 
	supplement the explanation in the first edition Foley & Van Dam.
	If I had it on-line I would have sent it to you, but you probably 
	still would need the base that it supplements.

>Hidden line/surface removal, line clipping, etc. is also needed.
	Line clipping is another section or two.  Hidden surface removal
	is a BIG chapter, although you might get a way with one or two
	sections if you knew which algorithm(s) was (were) appropriate
	to the application.
>
>PLEASE give me some information.

If you can't find the 2nd ed., Foley, Van Dam Feiner & Hughes, at a library
and won't pay their price, try one of the others....

Rogers - Procedural Elements for Computer Graphics, McGraw - Hill
Rogers & Adams - Mathematical Elements of Computer Graphics, McGraw-Hill
Newman & Sproull - Principles of Interactive Computer Graphics, McGraw-Hill
Hearn & Baker - Computer Graphics, Prentice - Hall

and there are many more.  These are just a few whose names and publishers
I could copy from my shelf.  

>
>And YES, I will post a summary if I get any information other than another
>reference to Foley and VanDamme's book...  (translation: DON'T SEND ME
>MAIL ASKING ME FOR HELP.  Last time I got 10 messages asking to send them
>info on this, and I didn't get any info)
>
>
>--
>peterc@neosoft.com                 "The rest is silence."     -- Hamlet
>

I find your complaints rude, both about "me too" messages AND that you didn't
like the answer you got.  This is Usenet.  You got more than you paid for,
even if it wasn't all you wanted.

Sam Uselton		uselton@nas.nasa.gov		ex-prof
employed by CSC		working for NASA (Ames) 	speaking for myself