HDTenEightyP/NetNews huggingface dataset:
From: g.coulter@daresbury.ac.uk (G. Coulter)
Newsgroups: comp.graphics.animation
Subject: Raytracer Wanted.
Date: 10 Nov 92 08:29:25 GMT
Reply-To: g.coulter@daresbury.ac.uk
Organization: Daresbury Laboratory, UK

I am doing a project for Uni and I require a script based raytracing program that
will run on a DEC station. Please also is there a raytracer that will run on a SUN
SPARCstation1. Thanks for any help.

Gary 
Newsgroups: comp.graphics.animation
From: jpitts@norfolk.vak12ed.edu (Joseph R. Pitts)
Subject: Job Descriptions Wanted
Organization: Virginia's Public Education Network (Norfolk)
Date: Thu, 12 Nov 92 18:49:04 GMT

I know this is probably the wrong place for this...but maybe
not! I'm in the process of writing job descriptions for myself
and an assistant(associate) and am willing to copy verbatim
anothers description if it fits my needs !!!!, well I'll fudge
with it some but i need a start. If you, or someone you know is
a graphic/animation designer and /or assistant(associate) or
something like one , email me.... also, (there's always an
also...) I would be interested in any salary information (ranges)
you could give and market size. (tv markets Norfolk is about
45th-47th usually)
		thanks or sorry,
			Joe Pitts,
		Graphics/Animation Designer
	           WHRO-TV, Norfolk, VA

		jpitts@norfolk.vak12e.edu
********
My opinions are.
Newsgroups: comp.graphics
From: PENG@rzmain.rz.uni-ulm.de (PENG WEIGUO)
Subject: SW to draw 2D graph from 2D grid needed
Organization: University of Ulm, Germany
Date: Wed, 11 Nov 1992 18:21:30 GMT
X-News-Reader: VMS NEWS 1.24

	Hi, I've got some data (ascii format) specified by a two dimentional 
grid in polar or x-y coordinates. Certainly I can draw it in a contour map. 
But with contour map the detail of the picture is lost. Is there any software 
avialable from FTP, which can draw 2D pictures in a gray step manner with 
scale bar, axes, description and title and ....

	Thank you
Newsgroups: comp.graphics
From: dfr@usna.navy.mil (PROF D. Rogers (EAS FAC))
Newsgroups: comp.graphics
Subject: Re: polyhedron/polyhedron intersection
Keywords: 3d graphics, intersection
Date: 11 Nov 92 15:48:42 GMT
Organization: U. S. Naval Academy

In article <1992Nov11.040142.9570@cis.uab.edu> sloan@cis.uab.edu (Kenneth Sloan) writes:
!In article <1992Nov10.221943.18792@sophia.smith.edu! orourke@sophia.smith.edu (Joseph O'Rourke) writes:
!!In article <1992Nov10.192804.13981@zip.eecs.umich.edu! katkere@engin.umich.edu writes:
!!!I am looking for code/ideas for finding if two polyhedrons intersect.
!!
!!@article{CD
!!, author =	"B. Chazelle and D. P. Dobkin"
!!, title =	"Intersection of convex objects in two and three dimensions"
!!, journal =	"J. ACM"
!!, volume =	34
!!, year =	1987
!!, pages =	"1--27"
!!}
!
!But Joe...what if the polyhedra aren't convex?  

Make them convex!!

Dave Rogers
Newsgroups: comp.graphics
From: katkere@eecs.umich.edu (Arun L. Katkere)
Subject: polyhedron/polyhedron intersection
Followup-To: comp.graphics
Keywords: 3d graphics, intersection
Reply-To: katkere@engin.umich.edu
Organization: University of Michigan EECS Dept., Ann Arbor, MI
Date: Tue, 10 Nov 1992 19:28:04 GMT

I am looking for code/ideas for finding if two polyhedrons intersect.
I think that polygon/polygon intersection will be used as a building
block for this. Is there a better way to do this? Can the sgi
rendering engine be used in any way to do this? Where can I find
code for polygon/polygon intersection?

I am not a c.g subscriber. But I searched thro' the FAQ, about 1300
subject lines, some ftp sites and couldn't find any info on this. Any
help will be appreciated.

Send replies to katkere@eecs.umich.edu.
Thanks,
-arun
-- 
+-----------------------------------------------------------------------------+
| Arun Katkere                      |   The University of Michigan AI Lab     |
| katkere@engin.umich.edu           |   147 ATL, 1101 Beal Avenue             |
| O:(313)763-1563 | R:(313)761-9462 |   Ann Arbor, MI 48109-2110              |
+-----------------------------------------------------------------------------+
Newsgroups: comp.graphics
From: nbs@mdf.mitre.org (Norm Sutherland)
Subject: Image Format Conversion Software on VMS
Organization: The MITRE Corporation
Distribution: usa
Date: Fri, 13 Nov 1992 15:09:18 GMT

I have TARGA-16 images being deposited on a VAX running VMS.  I'd like to 
convert these TGA files to PICT and TIFF for use on a Macintosh, and GIF 
for IBM PC's.  Does anyone know of a good format conversion package that 
could run under VMS?  Languages supported here under VMS  include BASIC, 
FORTRAN, Ada, and C.

At the moment, I'm dragging the TARGA files down from the VAX to a Mac 
IIx, and using Adobe Photoshop to do scaling and conversions.  Results are 
then uploaded to the VAX again, to populate our VMS-based file server.  
I'd like to be able to do the whole job directly on VMS.

I have a little experience with Alchemy from Handmade Software, running 
under DOS on a PC.  This is a very good package, indeed.  If I could find 
it's equivalent for VMS, I'd be a happy camper.

I'm not a regular NetNewser, and don't know much about FTPing, 
de-archiving, unzipping, and all that good stuff, so if anyone should 
point me to available software I'd appreciate a few hints on the mechanics 
of obtaining same.

Norm Sutherland      |     nbs@mdf.mitre.org
- - - - - - - - - - - - - - - - - - - - - - - - - -
"I am more stupid about some things than about others; not equally stupid 
in all directions; I am not a well-rounded person."
                                           - Saul Bellow -
Newsgroups: comp.graphics,comp.multimedia
From: alee@chimera.UWaterloo.ca (A. Lee)
Subject: Screen Capture Programs
Organization: University of Waterloo
Date: Sun, 8 Nov 1992 01:18:54 GMT

Does anybody have any info on a screen capture program which will capture a  
text screen and dump it to a graphics file (like a tiff or gif).

Please respond to MIMIC@SYSTEMS.WATSTAR.WATERLOO.EDU

Thanks,

Alex Lee
Project MIMIC
From: Jeff.Lindstrom@ofa123.fidonet.org
Newsgroups: comp.graphics
Subject: DKBtrace laid an egg.
X-Sender: newtout 0.02 Oct  1 1992
Date: 05 Nov 92  10:24:02

 DN> I compiled DKBTrace on 386BSD unix last night and left it
 DN> running as I slept to do an image (devil.dat).  Well after
 DN> two hours of thought it produced a 34K Targa file.  Only
 DN> problem is when I went to view this file, it gave me a 100x100
 DN> image of black.  Did this happend to anyone else?  The command
 DN> line I used was something like dkbtrace +ft +q0 +idevil.dat

  First off, you specified the lowest quality level (+q0), which only displays 
`quick' colors (no textures) and ambient lighting only.

  A black scene sounds like you forgot to put a light source in your .dat
file.  It is also possible that the only colors in the scene were defined
inside the TEXTURE blocks, where they would be ignored with +q0.

  The default is +q9 (see the docs on Command Line Parameters).  You should
also set a size for x and y.


--- Maximus 2.00
From: andy@osea.demon.co.uk (Andrew Haveland-Robinson)
Newsgroups: comp.graphics
Subject: converting 3 gray planes to color
Date: 5 Nov 92 04:43:08 GMT
Organization: Haveland-Robinson Associates


In article <9210231606.AA01083@annapurna.wbst147.xerox.com> leisner.henr801c@xerox.com writes:

>I have 3 images for the red, blue and green seperations (of a color image).
>Each one is essentially grey.
>I want to generate a file (preferrably ppm) which incorporates these 3>
 images...
>I looked at the pbmplus toolkit and didn't see anything...
>What's a good way to do it...

For Dos/Windows

Use Alchemy to convert to tif||tga||gif||bmp||pcx, then use Photostyler
for Windows - the image combination is trivial, and you get all the image
processing goodies too... Use alchemy to convert back to pbm if necessary.

Andy.

+-----------------------------------------------------------------------+
| Haveland-Robinson Associates   | Email: andy@osea.demon.co.uk         |
| 54 Greenfield Road, London     |        ahaveland@cix.compulink.co.uk |
| N15 5EP England. 081-800 1708  | Also:  0621-88756 081-802 4502       |
+-----------------------------------------------------------------------+
>>>> Those that can, use applications. Those that can't, write them! <<<<
Newsgroups: comp.graphics
From: iain@ee.ryerson.ca (Iain Campbell)
Subject: Re: New stereogram technique
Keywords: stereo stereograms random dot
Organization: Ryerson Polytechnical Institute, Toronto
Date: Fri, 6 Nov 1992 17:08:59 GMT

In article <dalessio.720998995@feldspar28> dalessio@rtsg.mot.com (Mario D'Alessio) writes:
>In the mail I just received an advertisement from N.E.
>Thing Enterprises, the makers of "Stare-EO", the random dot
>stereogram creator.  On the front is a stereogram of a
[etc etc]

I know NE Thing Enterprises and their stuff is good, but not 
public domain.  Does anyone know of any PD stereogram 
software ??????

Iain

dotesseyegeedotesseyegeedotesseyegeedotesseyegeedotesseyegeedotesseyegee
dotesseyegee                                                dotesseyegee
dotesseyegee     iain@ee.ryerson.ca       < now playing     dotesseyegee
dotesseyegee     iain@acsserv1.ryerson.ca < coming soon     dotesseyegee
dotesseyegee                                                dotesseyegee
dotesseyegeedotesseyegeedotesseyegeedotesseyegeedotesseyegeedotesseyegee
Newsgroups: comp.graphics
From: ykim@cs.columbia.edu (Yong Su Kim)
Subject: GIF image manipulation programs for SPARC
Organization: Columbia University Department of Computer Science
Date: Tue, 10 Nov 1992 21:27:02 GMT

Is there a good GIF image manipulation program for SPARC stations that
I can get from an ftp site?

I want to be able to read in GIF images, do mirror effects, rotation,
center etc. and save the result as a GIF file.  


-- 
===============================================================================
Yong Su Kim, Class of 1993		|  Internet: yk4@cunixb.cc.columbia.edu
Columbia College, Columbia University   |        or  ykim@cs.columbia.edu
			
Newsgroups: comp.graphics
From: srp@travis.csd.harris.com ( Stephen Pietrowicz)
Newsgroups: comp.graphics
Subject: Getting an outline from a bitmap
Date: 11 Nov 92 17:28:22 GMT
Organization: Harris CSD, Ft. Lauderdale, FL
NNTP-Posting-Host: travis.csd.harris.com

I'd like to get some pointers for obtaining an outline from a bitmap, in
the form of a list of ordered points.  When I say "ordered" I mean if I 
took the points and connected the first to the second, the second to the
third, I would get the online of the object.  (As opposed to a "random" set
of points that didn't preserve that information).  Tips/hints/references
and or code would be greatly appreciated!

Steve
-- 
Where humor is concerned there are no standards -- no one can say what
is good or bad, although you can be sure that everyone will.
-- John Kenneth Galbraith
From: cammarta@bucknell.edu (aaron cammarata `93)
Newsgroups: comp.graphics
Subject: RenderMan users, and motion question.
Date: 12 Nov 92 01:52:13 GMT
Article-I.D.: coral.1dsdcdINN60t
Distribution: world
Organization: Bucknell University, Lewisburg, PA
NNTP-Posting-Host: mizar.cs.bucknell.edu


	I'm currently working on an animation generated with RenderMan,
and I'm running into a problem with motion.
	I'm generating the frames using a for loop to do transformations
based on the frame number to give seamless motion, and I quickly found
that it gave jumpy motion anyway.  I changed it to accelerate based on
frame# squared, and that gave better results.  (*Much* better ;)
My question is, does anyone know of a) an easier way to do motion that
camera transformations before the WorldBegin, and b) any other way to move
in a more realistic motion than x^2 acceleration.
	Finally, I am interested in starting correspondence with any other
RenderMan users out there to trade ideas, shaders, etc.  I took the
"Writing RenderMan Shaders" course at SG '92, and I can help with that.  I'd
be interested in writing a shader as a team, as well.

-- 

					Aaron


==================================================================================
cammarta@bucknell.edu|     "Life is pain, Highness.
  B4ILUVU, UCT, RU   |         Anyone who says differently is selling something."
                18   |                     "The Princess Bride"
==================================================================================
From: jims@techsup.UUCP
Date: 06 Nov 92 09:45 CST
Newsgroups: comp.graphics
Subject: Re: DKBtrace laid an egg.
Message-ID: <7200001@techsup>
Nf-ID: #R:<720942680snx@osea.demon.co.uk>:-31:techsup:7200001:000:1731
Nf-From: techsup.UUCP!jims    Nov  6 09:45:00 1992



/* ---------- "DKBtrace laid an egg." ---------- */

In article <smithbm.720900720@craft.camp.clarkson.edu> smithbm@craft.camp.clarkson.edu writes:

>So, try typing this as a command line:
>
>dkbtrace +ft +a +q9 -x640 -y480 +idevil.dat -odevil.tga
>Hope this helps you!
>
>>    -Dan Newcombe
>>Internet Address:  STDN@VM.MARIST.EDU

>>>Probably not! That should read:

>>>dkbtrace +ft +a +q9 -w640 -h480 +idevil.dat -odevil.tga
                    ~~~~~~~~~~~
>>>+-----------------------------------------------------------------------+
>>>| Haveland-Robinson Associates   | Email: andy@osea.demon.co.uk         |
>>>| 54 Greenfield Road, London     |        ahaveland@cix.compulink.co.uk |
>>>| N15 5EP England. 081-800 1708  | Also:  0621-88756 081-802 4502       |
>>>+-----------------------------------------------------------------------+
>>>> Those that can, use applications. Those that can't, write them! <<<<

I use DKBtrace quite a bit and I found that having a bunch of pre defined 
TRACE.DEF files handy. I have a simple batch file for each resolution that
copies the correct parameters int the TRACE.DEF file. The following is a list
of the parameters I use:

TRACELR.DEF
-w200 -h100 -v +ft +d9 +p +x -a -q4
The above will create 200x100 picture with no anti alias, no textures, and no
reflection/refraction/transmitted rays. This will make a tga picture in about
two minutes on a 486/33.

TRACEHR.DEF
-w800 -h600 -v +ft +d9 +x +a -q9
This will create an 800x600 with all the bells and whistles. Note this will 
take alot longer (1 to 2 hours on 486/33) so be patient |:).

To use them, simply copy the one you want into the TRACE.DEF file and then run
DKB and the file name.

Jim Skilskyj
utacfd!rwsys!techsup!jims

Newsgroups: comp.graphics,comp.graphics.animation
From: jk87377@cc.tut.fi (Juhana Kouhia)
Subject: Re: graphtal 1.0 : First public release available
Organization: Tampere University of Technology
Date: Fri, 6 Nov 92 12:49:44 GMT


In article <1992Nov5.155840.11677@aragorn.unibe.ch> streit@iam.unibe.ch writes:
>
>Here's a (hopefully) useful description of my program:

Excellent, marvelous :-)

>PS2: Juhana, for the next time, could you please write down just 
>     one nice word in your message? 

I didn't thought that my article sounded that bad, sorry.
I usually don't write bad flames.

Let's see those nice words I did use:

  Hi
  Please
  please

It seems that I will include 'please' to every sentence in future, so
that I don't sound too rude.
I just tried to give some help in writing an announce.


Juhana Kouhia
Newsgroups: comp.graphics
From: rms@well.sf.ca.us (richard marlon stein)
Subject: Pipeline computation estimates
Summary: How to estimate pipeline times for polygons?
Organization: Whole Earth 'Lectronic Link
Distribution: usa
Date: Mon, 9 Nov 1992 15:46:01 GMT

Does anyone have a quick and dirty method to estimate how much time (=ops)
are required to transform, shade, and scan convert a polygon?
--rick
-- 
Richard Marlon Stein, Internet: rms@well.sf.ca.us
To those who know what is not known;  The Chronicles of Microwave Jim!
Newsgroups: comp.graphics
From: "Suzanne Menzel" <menzel@moose.cs.indiana.edu>
Subject: Character Graphics
Organization: Computer Science, Indiana University
Date: Tue, 10 Nov 1992 14:59:29 -0500



I am looking for some small pictures, generated by ordinary ASCII
characters, similar to the Snoopy calandars of old.

By small I mean squares in the range 10x10 to 40x40, and using a
simple "grey scale" for characters, like

		' '
		'.'
		','
		';'

	and so on

		'@'

If you have anything like this, I would appreciate it if you would
send it my way.

Thanks
Newsgroups: comp.graphics,comp.graphics.visualization,comp.graphics.animation
From: kyriazis@mistral.rdrc.rpi.edu (George Kyriazis)
Subject: Re: FOLLOW-UP: FTP SITE FOR 3D MODELS/UTILS
Organization: Rensselaer Design Research Center, RPI, Troy, NY
Distribution: na
Date: Fri, 6 Nov 1992 02:37:55 GMT

In article <1992Nov5.142035.20498@alias.com> Reid Ellis <rae@Alias.com> writes:
>If you want a standard format
>that can handle curves and spline surfaces, there's always IGES.
>
>Does IGES handle NURBS?  I can't recall offhand..
>
Yes, it does.. I am not sure, but I think it also handles connectivity
(ie., topological information) which is always a plus..

Running the risk of stating the obvious, I'll say that it looks like
it's pretty difficult task to choose a file format that satisfies most of
us.  What's important in some people is not important to others.  I know
of conversion packages that have the ability of converting from one
data format to another with relatively no pain, but (unfortunately)
you have to buy them.

It's pretty difficult not to write such software without having money in 
his mind, so I predict that this discussion about what is the "right" format
could go on for a LONG time..

  --george
-- 
----------------------------------------------------------------------------
George Kyriazis       | Visual Technologies Program, Rensselaer Design
kyriazis@rdrc.rpi.edu |  Research Center, CII 7015, RPI, Troy, NY 12180
----------------------------------------------------------------------------
Newsgroups: comp.graphics
From: jos@bull.nl (Jos Vos)
Subject: Re: PBM Formats
Keywords: PBM, file formats
Organization: Bull, P.O. Box 22859, NL-1100 DJ Amsterdam, The Netherlands
Date: Wed, 11 Nov 1992 09:47:34 GMT

iain@ee.ryerson.ca (Iain Campbell) writes:

>Whats the difference between a P4 PBM file and a P1 PBM file ???

P1 PBM includes a hexadecimal bitmap and its size information.
P4 PBM includes a raw ("binary") bitmap. This format costs about half
the space of a P1 PBM bitmap.

-- 
--    Jos Vos <jos@bull.nl>   (UUCP: ...!{uunet,mcsun,sun4nl}!nlbull!jos)
--    Bull Nederland NV, Product Support Unix, Amsterdam, The Netherlands
Newsgroups: comp.graphics
From: dalessio@rtsg.mot.com (Mario D'Alessio)
Subject: New stereogram technique
Summary: New stereogram technique
Keywords: stereo stereograms random dot
Organization: Motorola Inc., Cellular Infrastructure Group
Distribution: usa
Date: Thu, 5 Nov 1992 21:29:55 GMT

In the mail I just received an advertisement from N.E.
Thing Enterprises, the makers of "Stare-EO", the random dot
stereogram creator.  On the front is a stereogram of a
frog. But the cool thing is that when you view the image,
you can't detect any "layers" in the image.

Those of you who viewed the stereograms posted here before
know that the stereograms are created from layers. A sphere
is actually created of layered circles which can be easily
detected. With the new technique, you'll see a smooth sphere.

The ad states that it uses the "Salitsky dot".  Does anyone
know anything about this? How about a program that uses
it?

Thanks.

Mario


************************************************************
* ******************************************************** *
* *  __________________           __                     * *
* *  \_________________|)____.---'--`---.____            * *
* *                ||    \----.________.----/            * *
* *  __/\__      __||____/ /_    `--'                    * *
* *  \RUSH/     |___         \   Mario D'Alessio         * *
* *   |/\|          `--------'   dalessio@rtsg.mot.com   * *
* *                                                      * *
* *    Work: (708) 632-2323  9am to 6pm Central Time     * *
* ******************************************************** *
************************************************************
From: chuckb@stein.u.washington.edu (Charles Bass)
Newsgroups: comp.graphics
Subject: Re: polyhedron/polyhedron intersection
Keywords: 3d graphics, intersection
Date: 11 Nov 92 07:10:10 GMT
Article-I.D.: u.1992Nov11.071010.721
Organization: University of Washington


I am using an algorithm developed at the University of
Washington.  It has been accepted for publication but as of
today it is not known when it will be published.

I use the routines to detect collisions between solid modeled
objects in a real time simulation program.  In general the
routine has proven an improvement over our previous (n^2)
routine.  Some details:

1) It requires triangulated polygons.
2) It is well suited for checking collisions between moving
   objects (ones that don't overlap very much)
3) In practice the algorithm is very fast although the worst
   case looks to run in O((n^2)/2) time
4) Several "speed hacks" have been incorporated.  These mostly 
   are marginal but in the name of efficiency... (and less
   readable code ;-))
5) Convex hull information can marginally speed the test.  
6) I did *not* implement an engulfment test.  I don't have
   details on this process but could possibly provide a ref. 
For details email me.


Chuck Bass                             |
College of Forest-Systems Engineering  |
University of Washington               | FAX   (206)-685-3091
Mailstop AR-10                         | voice (206)-685-2198
Seattle,  WA  98195                    | email chuckb@u.washington.edu
From: dfr@usna.navy.mil (PROF D. Rogers (EAS FAC))
Newsgroups: comp.graphics
Subject: Re: polyhedron/polyhedron intersection
Keywords: 3d graphics, intersection
Date: 11 Nov 92 15:51:44 GMT
Organization: U. S. Naval Academy

In article <1992Nov11.135107.27052@sophia.smith.edu> orourke@sophia.smith.edu (Joseph O'Rourke) writes:
!In article <1992Nov11.002123.27579@kpc.com! hollasch@kpc.com (Steve Hollasch) writes:
!!    ... Trivial Reject ...  Trivial Accept ...
!!    If neither of these tests succeed, then you must test each vertex of P
!!to see if it lies within Q, and then you have to test each vertex of Q to
!!determine if it lies within P.
!
!	These tests are not sufficient to detect intersection, as two
!polyhedra may intersect without any vertex of one being inside the other.

An example might help--either you or Ken Sloan.

Dave Rogers

Newsgroups: comp.graphics,comp.graphics.animation
From: dluckma3@mach1.wlu.ca (david luckman 9209 U)
Subject: Re: .GL animation Files
Organization: Wilfrid Laurier University
Distribution: usa
Date: Wed, 4 Nov 1992 07:00:54 GMT

Where can I find a good collection of .GL movies.  I have seen a few in
greyscale that were impressive but I want to find more...Suggestions?

Dave
From: marple@cs.ubc.ca (Kirk Marple)
Newsgroups: comp.graphics
Subject: Polygon Vertex Normals
Date: 12 Nov 1992 16:08:23 -0800
Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
NNTP-Posting-Host: cascade.cs.ubc.ca
Keywords: Normals

Does anyone know a fast technique to find the normals at 
the vertices of a 3-d polygonal figure?  (when you've
been given the polygon normals)

I've been using a brute-force bucket-sort sort of approach, where
you run through the vertices for each polygon and stick the 
index of the polygon in the bucket for the corresponding vertex.

Then I go through and for each vertex, I average the polygon normals
for the polygons in the vertex's bucket.

The order of the algorithm is pretty scary, so I was hoping there
would be a better way to do it.

By the way, my figures are coming in OFF format, so I have access
to vertex and edge information.

Thanks to anyone who responds, (e-mail or news posting is OK)

Kirk Marple
marple@cs.ubc.ca


Newsgroups: comp.graphics