HDTenEightyP/NetNews huggingface dataset:
From: bigbrd!ersys!vchan@cs.alberta.ca (Victor Chan)
Newsgroups: comp.graphics
Subject: Mail might bounce coming to me (Victor Chan)
Date: Wed, 08 Apr 92 22:27:43 MDT
Organization: Edmonton Remote Systems #3, Edmonton, AB, Canada

I apologize for wasting bandwidth like this (gomen nasai!) but...
 
        ...there might be people trying to e-mail me out there on the 
net.  Our system's down right now so to those who tried e-mailing me
please re-direct to either of 2 addresses listed in my sig.  If you're
posting anything directly for me on this group, please include my name in 
the header as I have to be selective about the posts I read.  Until our
header as I have to be selective about the posts I read.  Until our 
'state of emergency' is lifted, onto our regular programming...
of emergency' is lifted, onto our regular programming...
 
 
                                                        Victor Chan
                                                        April 8, 1992     


<< Unless it's local - please don't e-mail above address. Gomen nasai. >>
<< Our system's down and it can't get up! Please e-mail to below only! >>
* Victor Chan - Secretary of the *          userBAKA@mts.ucs.ualberta.ca
*  Banzai Anime Klub of Alberta  *          userV4D0@mts.ucs.ualberta.ca
From: hollasch@kpc.com (Steve Hollasch)
Subject: Re: three dimensional geometry
Summary: Correction and other suggestions.
Organization: Kubota Pacific Computer, Inc.
Date: Mon, 6 Apr 1992 21:14:53 GMT

reznick@acfcluster.nyu.edu writes:
| i have what (i think) is a very simple question.  my geometry sense has
| fled from my brain, so i can't seem to figure it out.
| 
| all i want to do is, given three vertices [x,y,z] [x1,y1,z1] [x2,y2,z2]
| of an equalateral triangle, how can i compute the fourth vertex needed
| to make a three dimensional triangular pyramid?  (all facets are equalateral
| triangles).  thanks.

hollasch@kpc.com (Steve Hollasch) writes:
|     You are indeed correct; it is a simple problem.  In fact, there are
| infinitely many solutions to this problem; how you choose them is up to
| you.  [description of four-space (that's one _more_ than three-space!)
| solution]
|     
|     By definition of the triangular pyramid, the distance of a solution
| point from the centroid is equal for all three vertices.

    This should really be

      By definition of the triangular pyramid, the distance of a solution
  point to each of the three vertices is equal.

    By the way (as long as I'm here), the solution I proposed easily
extends into higher spatial dimensions, with the added bonus that you get
an even _larger_ set of infinite points!  A good set of infinite points is
a real pleasure, but a really _big_ set of infinite points is ecstasy.

    There are other solutions, though.  The following algorithm should
work nicely:

    1.   Find the centroid of the triangle and call this point C.
    2.   Let R = |V1 - V0|.
    2.5  Let D = R.
    3.   Generate a random point P in the sphere of radius R, centered at
         point C.
    4.   Find the largest difference in distances between P and each of the
         three vertices, called Dd.
    4.2  If Dd < some epsilon, quit; the point P is the solution.
    5.   If Dd < D, then let C = P, and let R = 0.7311 * R.
    6.   Go to step 3.

    This algorithm has the advantage that someone's already done it for
you.  The one thing to watch out for is that it may not work.  But I think
that sometimes it might work.  I really don't know.

    Hope this helps.

________________________________________________________________________
Steve Hollasch                             Kubota Pacific Computer, Inc.
hollasch@kpc.com                           Santa Clara, California
Newsgroups: comp.graphics,alt.binaries.pictures.d,alt.binaries.pictures.misc
From: 2787al@gmuvax2.gmu.edu (Death Angel)
Subject: Re: JPEG viewer for win3.0 and 3.1
Keywords: jpeg
Organization: George Mason University, Fairfax, Va.
Date: Mon, 13 Apr 1992 18:42:29 GMT

In article <1992Apr11.004222.15676@iplmail.orl.mmc.com> billr@iplmail.orl.mmc.com (Bill Richmond) writes:
>
>	Why don't you simply convert the jpg files to gif & then
>view those?
>
>         __   __         __   __          ____
>        /\ \ /\ \       / /\ /\ \        /  \_\
>       /  \_\\ \ \     / / / \ \ \      / /\ |_|
>      / /\ | |\ \ \   / / /   \ \ \     \ \/ /_/_
>     /  \/ |_| \ \_\ / / /     \ \ \     \  __ \_\
>    / /\ ./ /   \/_/_\ | |     | | /      \ \ \/_/_
>    \ \/ |_|      /\_\\ \ \   / / /        \ \_\ /_/\
>     \__/_/       \/_/ \/_/   \/_/          \/_/ \_\/

  Because the quality of the picture will decrease and why do that if
there is a jpeg viewer availble?

P
P
S
S
S
  
Newsgroups: comp.graphics
From: stgprao@xing.unocal.com (Richard Ottolini)
Subject: Re: Morphing
Originator: stgprao@xing
Organization: Unocal Corporation, Anaheim, California
Date: Tue, 14 Apr 1992 22:09:08 GMT

We know that a special-effect has reached the "big time" when it is used in a
TV cop show.  I predict such about a shape-shifter in the next year or two.
Newsgroups: comp.graphics
From: barnes@weedeater.math.yale.edu (Craig Barnes)
Subject: Contour plots..
Organization: Yale University Department of Mathematics
Date: Mon, 6 Apr 1992 21:43:37 GMT


I am looking for any package out there that can
produce a contour plot, I have the following requirements:

1) I need to be able the specify the x and y coordinates
   for each z value, (I have a non-rectangler grid)

2) I need to be able to produce filled contour plots

3) and I need to be able to plot many levels (like 100-255)

I have used IDL, which is great, except that I can't get more
than 30 levels, so I am looking for a different package.

If anyone has a suggestion. I would really
appreciate it,


Thanks,

Craig Barnes


Newsgroups: comp.graphics
From: acc@asterix.inescn.pt (Antonio Costa)
Newsgroups: comp.graphics
Subject: 24 bit/pixel files
Date: 6 Apr 92 13:37:27 GMT
Organization: CG & CAD - INESC Norte

In machine asterix.inescn.pt (192.35.246.17) there are 24 bit/pixel files,
JPEG encoded (with 'cjpeg -Q 95') available by anonymous ftp in directory
pub/RTtrace/images...

Ciao,
Antonio.
From: n8443916@henson.cc.wwu.edu (John Gossman)
Newsgroups: comp.graphics
Subject: Re: 3D -> 2D translation
Date: 13 Apr 92 18:12:33 GMT
Article-I.D.: henson.1992Apr13.181233.12296
Organization: Western Washington University

uselton@wk207.nas.nasa.gov (Samuel P. Uselton) writes:


>>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.
>>PLEASE give me some information.
>>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
>>
^^^^^^^^^^^^^ Please note this name
>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 you don't like the answer you got.

	I also replied to this Peter Creature, giving him some references
to look at--and he responded by private e-mail calling me an a**hole for
belittling him.  I don't think he deserves any more help.

	John Gossman
From: ehobbs@nmt.edu (Eric Hobbs)
Newsgroups: comp.graphics
Subject: Optically Realistic Raytracers?
Date: 16 Apr 92 17:05:35 GMT
Article-I.D.: nmt.1992Apr16.170535.22495
Organization: New Mexico Institute of Mining and Technology

Is there a raytracer out there that takes into account the 
phase of light, thus making interference patterns possible?
For that matter, do any of them consider light coherency and
diffraction?  Can you simulate a laser beam arrangement with
any of the raytracers.  I thought it might be neat to do some
optical modeling.

Any suggestions, or am I out of luck?

Eric A. Hobbs
ehobbs@JUPITER.nmt.edu
From: hollasch@kpc.com (Steve Hollasch)
Newsgroups: comp.graphics
Subject: Re: three dimensional geometry
Date: 6 Apr 92 18:21:07 GMT
Article-I.D.: kpc.1992Apr6.182107.1242
Organization: Kubota Pacific Computer, Inc.

reznick@acfcluster.nyu.edu writes:
| i have what (i think) is a very simple question.  my geometry sense has
| fled from my brain, so i can't seem to figure it out.
| 
| all i want to do is, given three vertices [x,y,z] [x1,y1,z1] [x2,y2,z2]
| of an equalateral triangle, how can i compute the fourth vertex needed
| to make a three dimensional triangular pyramid?  (all facets are equalateral
| triangles).  thanks.

    You are indeed correct; it is a simple problem.  In fact, there are
infinitely many solutions to this problem; how you choose them is up to
you.  What we want is the set of points which are equidistant from the
three vertices.  It turns out that this set of points is simply the
three-sphere (commonly referred to as the hypersphere).  With center at
the centroid of the equilateral triangle and distance r.

    So, first we find the center of the hypersphere.  This is just the
centroid of the triangle (using row-vector notation):  [C0 C1 C2 C3] =
[ (x+x1+x2)/3 (y+y1+y2)/3 (z+z1+z2)/3 0 ].  Now, how do we find the radius
of this hypersphere?
    
    By definition of the triangular pyramid, the distance of a solution
point from the centroid is equal for all three vertices.
                                    2    2    2
    Using the pythagorean theorem, L  = r  + d , where L is the
edge length of the pyramid, h is the "height" of the solution point from
the centroid of the triangle, and d is the distance from the center of the
triangle (which I've given above) to one of the vertices.  You can
calculate L easily by finding the distance between any two of the original
vertices.

    Thus, the solution to this problem is simply the set of points on the
                                                              2   2
hypersphere with center C (shown above) and radius r = sqrt (L - d ).

    Some people may suggest that you intersect this hypersphere with one
of the three-spaces that contain the original three points, but that would
really restrict the solution set -- in fact, it would yield only two
intersection points, which would greatly (infinitely) reduce your choices.

________________________________________________________________________
Steve Hollasch                             Kubota Pacific Computer, Inc.
hollasch@kpc.com                           Santa Clara, California
From: gananney@mosaic.unccvax.uncc.edu (Glenn A Nanney)
Newsgroups: comp.graphics
Subject: high resolution mouse driver for pc super vga
Date: 16 Apr 92 20:47:28 GMT
Distribution: usa
Organization: University of NC at Charlotte

Hi,

I'm having a problem with my PC mouse driver.  I've written an application 
which polls the mouse using int 33h.  Although the program works fine 
in standard vga mode (640x480x16), when I increase the rez to 800x600x256
or 640x480x256 my mouse cursor disappears.  I'm using a Tseng Labs ET4000
chipset on my
video card and a standard Microsoft mouse driver.  I've also tried the newest 
driver put out for the Genius mice.  Still no cursor.

Would someone please let me know what I am doing wrong?  Any help, references,
or pointers would be greatly appreciated.

Thanks!      Glenn    aka   gananney@mosaic.uncc.edu
From: epetelhb@ccwf.cc.utexas.edu (Erik Peterson)
Newsgroups: comp.graphics
Subject: VIVID2?
Date: 16 Apr 92 23:27:13 GMT
Reply-To: epetelhb@ccwf.cc.utexas.edu (Erik Peterson)
Organization: The University of Texas at Austin, Austin TX
Originator: epetelhb@louie.cc.utexas.edu



Has anyone seen or heard about VIVID2.  (the raytracer)
Source this time?

Later,
Erik
From: Greg.Cason@f144.n363.z1.fidonet.org (Greg Cason)
Newsgroups: comp.graphics
Subject: Re: IBM graphics --> Videotape
Date: 11 Apr 92 15:36:00 GMT
Organization: FidoNet node 1:363/144

>.  I work at a production studio at the University of Maryland, and
>.  one of the things we want to do is to record what happens on
>.  an IBM-compatible computer without pointing a camera at a screen
>.  or an LCD-projected image.  We want to pipe the computer output
>.  some device that will convert it into a composite NTSC signal
>.  suitable for recording on videotape.
>.  Note: This would not be an attempt to use the system to generate
>.  videographics. Rather, it would be used to record what takes place
>.  on a computer screen for software demonstration purposes (for
>.  example).

Check out any of the "Computer Shopper" type magazines.  Any of them should
 have a video board suitable for your needs.  My company uses them extensively,
 but our equipment is geared more towards film than VHS so I can't give you any
 advice, except that I know they exist.

--  

---------------------------------------------------------------------
"Of all the things I've lost, it's my mind I miss the most."

        Greg Cason  -  via FidoNet Node: 1:363/42
             UUCP:  -  ...tarpit!alfred!business!144!Greg.Cason
             ARPA:  -  Greg.Cason@f144.n363.z1.fidonet.org
Newsgroups: comp.graphics
From: frank@cs.mcgill.ca ()
Subject: Help with PIXAR
Originator: frank@binkley.cs.mcgill.ca
Organization: SOCS, McGill University, Montreal, Canada
Date: Wed, 15 Apr 1992 17:45:45 GMT


To those who have the PIXAR imaging computer.

I am now trying to program with PIXAR's ChapVolume and want to run the
demo program for 'expose' and 'vint' first, but find the data set (for all
the demo program) is incomplete. To be more accurate, the number of data
files in directory /usr/pixar/vip/demo/data should be 192 (f.0 - f.191), I
have only 12 files left (f.0 - f.11). They had been deleted to save disk
space before and now I can't even find the backup tape for these data
files.

If anyone has the complete data files and would like to arrange a transfer,
please do drop me a line. Your help would be greatly appreciated.

Thanks in advance.

-- 
 Email: frank@cs.mcgill.ca          ||    Frank X.J HUANG     
 Tel  : (514)398-2619 (Office)      ||    School of Computer Science   
        (514)737-7366 (home)        ||    McGill University
_Fax  : (514)398-3883_______________||___ Montreal, Canada H3A 2A7 ___
From: Peter.Gorny@arbi.informatik.uni-oldenburg.de (Peter Gorny)
Newsgroups: comp.graphics
Subject: S.P.I.E.  ??
Date: 9 Apr 92 14:57:17 GMT
Organization: University of Oldenburg, Germany

Can anyboby help me: what does SPIE mean. It is a journal or a series
of proceedings also on graphics...

Peter Gorny

+--------------------------  Prof. Dr. Peter Gorny  --------------------------+
| Informatics Department    -   Computer Graphics & Software-Ergonomics Group |
| Carl von Ossietzky Universitaet Oldenburg  -  POB 2503  -  D-2900 Oldenburg |
|-----------------------------------------------------------------------------|
| * Internet *                                   * Telephone *                |
| Peter.Gorny@arbi.Informatik.Uni-Oldenburg.DE   Office:        +441-798-2901 |
| * Bitnet *                                     Secretariat:   +441-798-4521 |
| 040003@doluni1.bitnet                          Fax:           +441-798-2155 |
+-----------------------------------------------------------------------------+
From: dratliff@ub.d.umn.edu (Evad Ffiltar)
Newsgroups: comp.graphics
Subject: Normalization of small numbers to graphics screen
Date: 6 Apr 92 22:36:06 GMT
Distribution: comp
Organization: University of Minnesota, Duluth. Information Services.



Greetings,

	I am currently working on a simple program for an IBM clone using
turbo pascal and a VGA graphics adapter.  I have data that I must plot
relative to it's rank of the smallest and largest.  It is sort of
a generic routine that I want to implement for a function drawing program.  
The main thing I want to do is preserve the position and value.  I have come
up with a normalization routine for large and infinitely large values, but
not for small and infinitely small values in the domain (0 < x < 1).  
So, my question really is, does anyone know how to do this simply.  I want to
normalize the number to the next whole exponent.  I would appreciate any
info.  E-mail me or post, I prefer email because I am a student and I don't
get alot of time to read news.  Thank you.


				           \   	-----------------------|--|
				             \ 	David J. Ratliff       |  |  
==============================================-	dratliff@ub.d.umn.edu  |  |  
				             /	dratliff@cpe.d.umn.edu |  |  
				           /   	-----------------------|--| 
Newsgroups: comp.graphics
From: ps@elan.princeton.edu (Peter Schroeder)
Subject: Re: Distributing Points on a Sphere
Organization: Computer Science Department, Princeton University
	<sgp.702788869@phyast.nhn.uoknor.edu> <1992Apr9.160333.29567@kpc.com>
Date: 10 Apr 92 08:10:42

In article <1992Apr9.160333.29567@kpc.com> hollasch@kpc.com (Steve Hollasch) writes:
   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 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.

   sgp@gpsparc.nhn.uoknor.edu (Steven G. Parker) writes:
   | For each point, generate three random numbers between -1 and 1, and then
   | normalize them.  This will give you a random point on a unit sphere
   | in cartesian coordinates.

       Note also that there are _two_ distinct problems of this type:

       1)  Find some function that generates a random point on the surface
	   of a sphere, such that all locations on the sphere have equal
	   probability.

       2)  Given n points, distribute these points "evenly" or "uniformly"
	   across the surface of the sphere.

How about placing the desired number of points on the sphere in any old way
you like and then running a relaxation. Define each point to have a
repelling force about it and maintain the constraint of staying on the
sphere. A few iterations of F=MA will give you something that may or may
not be what you actually had in mind. It certainly does satisfy _some_
notion of ``evenly distributed''.

Peter
From: epetelhb@ccwf.cc.utexas.edu (Erik Peterson)
Newsgroups: comp.graphics
Subject: X-WINDOWS TGA VIEWER:
Date: 8 Apr 92 08:26:48 GMT
Organization: The University of Texas at Austin, Austin TX


I am a new X-windows user and I was wondering if anyone is currently using a 
good image processing or viewer for X windows on a sparc.
I would like to find soe of these to help out in my animations and raytracing.

Thanks alot,

Erik
DKB, DTA, SNDPPR, ...

Xref: sparky comp.graphics:5193 alt.binaries.pictures.d:2231 alt.binaries.pictures.misc:4173
From: davidsen@yeti.crd.GE.COM (william E Davidsen)
Newsgroups: comp.graphics,alt.binaries.pictures.d,alt.binaries.pictures.misc
Subject: Re: JPEG viewer for win3.0 and 3.1
Keywords: jpeg
Date: 6 Apr 92 13:37:02 GMT
Reply-To: davidsen@crd.ge.com (bill davidsen)
Organization: GE Corporate R&D Center, Schenectady NY

In article <1992Apr3.000938.25543@unx.sas.com>, saskxm@grovel.unx.sas.com (Kevin Mosman) writes:

|  Steve, throttle back guy. relax. have a valium. he's just trying to be helpful.
|  No offense, just be cool.
|  
|  Stefan, your intentions are appreciated, at least by me ( and I dont even have
|  the right stuff to use your information). I think you are falling well in line
|  with the tendency of this newgroup to try to share pix and info.

Yeah, I thought the information was useful, and in abusiness setting the
price may be high, but so are the hourly rates of Phd's and engineers.
If we were using JPEG and PCs it would make sense to spend the money on
some people.

When other products come on the market I bet the price will drop, and
right now there's nothing which will display in reasonable time. When
you have the only game in town you charge what the market will bear,
like the guy who's actually shipping 586s, at $8k a pop for the
barebones system. That price will come down when other get into the act,
too.
-- 
	- bill davidsen (davidsen@crd.ge.com)
	GE Corp. R&D Center; Box 8; Schenectady NY 12345
By analysis of usenet source, the hardest part of C to use is the comment
From: psebos@ntua.gr (Panaywths Sebos)
Newsgroups: comp.graphics
Subject: ---> Looking for a .jpg format viewer for PC (SVGA)
Date: 9 Apr 92 09:15:23 GMT
Organization: National Technical University of Athens

Hello ......
I have a lot of .jpg format images but I cannot view them on my PC (SVGA card) .I can only view them on a sparcstation machine
Can anyone out there help me!!!!!!!!!!??????
Thanx in advance.....
        Panos Sebos
Newsgroups: comp.graphics,comp.sys.ibm.pc.misc
From: stevela@beach.csulb.edu (Steve La)
Subject: Re: fahrenheit 1280 drivers
Organization: Cal State Long Beach
Date: Fri, 10 Apr 1992 23:12:21 GMT

Is there a new Fahrenheit display driver for Windows 3.1?  The older display
driver doesn't work with Windows 3.1...

Also, what are the differences between Fahrenheit BIOS version 1.1 and version
1.2?  

Thanks in advance...
-Steve
  ___   _____   ____   _  _   ____       _       __           Steve La     
/ ___) (_   _) | ___) | || | | ___)     | |     /  \       Network Manager 
\__  \   | |   | _)_  | || | | _)_      | |__  | || |     stevela@csulb.edu
(____/   |_|   |____)  \__/  |____)     |____) |_||_|      (310) 985-4750  
CALSTATE UNIVERSITY LONG BEACH, 1250 Bellflower Blvd. Long Beach, CA  90840
From: qingying@ac.dal.ca
Newsgroups: comp.graphics
Subject: Question:  How to convert CGM to Raster
Date: 15 Apr 92 01:41:35 GMT
Organization: Dalhousie University, Halifax, Nova Scotia, Canada


  I want to transform the CGM files to Sun's Raster files.  Could anyone 
give me some information on how to do that?
  Thanks a lot.
Newsgroups: comp.graphics.visualization,bionet.software
From: noel@chpc.utexas.edu ((user name unknown))
Subject: VisiCoor -- protein visualization program
Keywords: visicoor, protein visualiation
Organization: The University of Texas System - CHPC
Distribution: bionet
Date: Tue, 7 Apr 92 15:40:14 GMT

Does anyone know how I can get VisiCoor which 
is a program for protein visualization?

This program has described in:

D.A. Kuznetsov and H.A. Lim
"VisiCoor -- A simple program for visualization of proteins"
Journal of Molecular Graphics, 1991(?)

Does anyone have the email address of the authors?

Also does anyone have the email address of E. Hamori
who seems to have done a lot of work on H-trees and H-curves 
for characterization of protein and DNA sequences.
-- 
Noel Menezes                            Internet: noel@hermes.chpc.utexas.edu
Research Assistant                      BITNET:   noel@uthermes
Center for High Performance Computing   Phone:    (512) 471-2447
Balcones Resarch Center & UT-Austin     Fax:      (512) 471-2445
From: stgprao@xing.unocal.com (Richard Ottolini)
Newsgroups: comp.graphics.visualization
Subject: Re: Group FAQ
Date: 6 Apr 92 15:06:14 GMT
Organization: Unocal Corporation, Anaheim, California
Originator: stgprao@xing

In article <1992Apr3.171313.19744@nas.nasa.gov> eugene@wilbur.nas.nasa.gov (Eugene N. Miya) writes:
>No sorry, this group does not have an FAQ (yet).
>Not enough frequently asked questions, yet to see patterns of commonality.

I would think a FAQ list would include
(1) A list of scientific graphics systems (e.g. AVS, aPe, etc.) and commerical
ones (e.g. Alias, Wavefront, etc.)
(2) A list of hardware vendors and performance specs for the kinds of 3-D
grpahics used in scivi.
(3) A list of other relevant newsgroups and FAQs.
(4) Books written on the subject.

I estimate each of these lists has a count of about ten.

Since I am not shopping for new hardware or software these days, I don't
always know the full state of #1 and #2.